How Good is the Chord Algorithm?
Download13093875x.pdf (1.203Mb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2016-06Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
SIAM Journal on Computing
Publisher
Society for Industrial & Applied Mathematics
Citation
Daskalakis, Constantinos, Ilias Diakonikolas, and Mihalis Yannakakis. “How Good Is the Chord Algorithm?” SIAM Journal on Computing 45, no. 3 (January 2016): 811–858. © 2016, Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0097-5397
1095-7111