How Good is the Chord Algorithm?
Name
13093875x.pdf
Size
1.2 MB
Format
Adobe PDF
Checksum (MD5)
12eddf8be35b1739abf91c91f5fec9d7
Author(s)
Yannakakis, Mihalis
Diakonikolas, Ilias
Daskalakis, Konstantinos
Date Issued
June 2016
Journal
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
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 settings.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/13093875X
