How Good is the Chord Algorithm?

• Main Authors: Yannakakis, Mihalis (Author), Diakonikolas, Ilias (Author), Daskalakis, Konstantinos (Contributor)
• Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
• Format: Article
• Language: English
• Published: Society for Industrial & Applied Mathematics, 2018-03-30T20:18:39Z.
• Subjects: Article
• Online Access: Get fulltext

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 settings.
National Science Foundation (U.S.) (CCF-07-28736)
National Science Foundation (U.S.) (CCF-10-17955)
National Science Foundation (U.S.) (CCF-13-20654)