Near-linear time approximation algorithms for curve simplification

Algorithmica (New York)

Volumn 42, Issue 3-4, 2005, Pages 203-219

  Agarwal, Pankaj K ^a   Har Peled, Sariel ^b   Mustafa, Nabil H ^a   Wang, Yusu ^a  

^a Duke University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Approximation algorithms; Computational geometry; Curve simplification

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; COMPUTER VISION; DATA COMPRESSION; ERROR ANALYSIS; GEOGRAPHIC INFORMATION SYSTEMS;

APPROXIMATION ALGORITHMS; CURVE SIMPLIFICATION; MONOTONE CURVES; POLYGONAL CURVES;

ALGORITHMS;

EID: 22344432453     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1165-y     Document Type: Conference Paper

References (13)

1. P. Agarwal and K. R. Varadarajan. Efficient algorithms for approximating polygonal chains. Discrete & Computational Geometry, 23:273-291, 2000.
2. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry, 5(1):75-91, 1995.
3. G. Barequet, D. Z. Chen, O. Daescu, M. T. Goodrich, and J. Snoeyink. Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica, 33(2):150-167, 2002.
4. W. S. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments. In Proc. 3rd Annual International Symposium on Algorithms and Computation, pages 378-387, 1992.
5. D. H. Douglas and T. K. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canadian Cartographer, 10(2):112-122, 1973.
6. M. Godau. A natural metric for curves: computing the distance for polygonal chains and approximation algorithms. In Proc. 8th Annual Symposium on Theoretical Aspects of Computer Science, pages 127-136, 1991.
7. L. J. Guibas, J. E. Hershberger, J. B. Mitchell, and J. Snoeyink. Approximating polygons and subdivisions with minimum link paths. International Journal of Computational Geometry and Applications, 3(4):383-415, 1993.
8. P. Heckbert and M. Garland. Survey of polygonal surface simplification algorithms. In SIGGRAPH97 Course Notes: Multiresolution Surface Modeling, 1997.
9. J. Hershberger and J. Snoeyink. An O (n log n) implementation of the Douglas-Peucker algorithm for line simplification. In Proc. 10th Annual ACM Symposium on Computational Geometry, pages 383-384, 1994.
10. H. Imai and M. Iri. An optimal algorithm for approximating a piecewise linear function. Information Processing Letters, 9(3):159-162, 1986.
11. H. Imai and M. Iri. Polygonal approximations of curve-formulations and algorithms. In G. T. Toussaint, editor, Computational Morphology, pages 71-86. North-Holland, Amsterdam, 1988.
12. A. Melkman and J. O'Rourke. On polygonal chain approximation. In G. T. Toussaint, editor, Computational Morphology, pages 87-95. North-Holland, Amsterdam, 1988.
13. R. Weibel. Generalization of spatial data: principles and selected algorithms. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of Geographic Information System, pages 99-152. Springer-Verlag, Berlin, 1997.