How good is the Chord algorithm?

Constantinos Daskalakis, Mihalis Yannakakis, Ilias Diakonikolas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and graphics. We analyze the performance of the chord algorithm, as compared to the optimal approximation that achieves a desired accuracy with the minimum number of points. We prove sharp upper and lower bounds, both in the worst case and average case setting.
Original languageEnglish
Title of host publicationProceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
Pages978-991
Number of pages14
ISBN (Electronic)978-1-61197-307-5
DOIs
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'How good is the Chord algorithm?'. Together they form a unique fingerprint.

Cite this