How good is the Chord algorithm?
Data Structures and Algorithms
2013-09-30 v1 Computational Geometry
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.
Cite
@article{arxiv.1309.7084,
title = {How good is the Chord algorithm?},
author = {Constantinos Daskalakis and Ilias Diakonikolas and Mihalis Yannakakis},
journal= {arXiv preprint arXiv:1309.7084},
year = {2013}
}
Comments
47 pages, full version of SODA 2010 paper