Near-linear time approximation algorithms for curve simplification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 29-41

  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

[No Author keywords available]

Indexed keywords

ERRORS;

CURVE SIMPLIFICATION; ERROR CRITERION; ERROR MEASURES; FRECHET; HAUSDORFF; MONOTONE CURVES; NEAR-LINEAR TIME; POLYGONAL CURVE;

APPROXIMATION ALGORITHMS;

EID: 84938080619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_7     Document Type: Conference Paper

References (13)

1. H. Alt and M. Godeau. Computing the frechet distance between two polygonal curves. International Journal of Computational Geometry, pages 75-91, 1995. 30, 36
2. N. Amenta. Finding a line transversal of axial objects in three dimensions. In Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 66-71, 1992. 33
3. P. K. Agarwal and K.R. Varadarajan. Efficient algorithms for approximating polygonal chains. Discrete Comput. Geom., 23:273-291, 2000. 30
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. 30
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. 31
6. L. J. Guibas, J. E. Hershberger, J. B. Mitchell, and J. S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. International Journal of Computational Geometry and Applications, 3(4):383-415, 1993. 31, 33
7. M. Godau. A natural metric for curves: Computing the distance for polygonal chains and approximation algorithms. In Proc. of the 8th Annual Symposium on Theoretical Aspects of Computer Science, pages 127-136, 1991. 30
8. 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. 31
9. H. Imai and M. Iri. An optimal algorithm for approximating a piecewise linear function. Information Processing Letters, 9(3):159-162, 1986. 31
10. H. Imai and M. Iri. Polygonal approximations of a curve-formulations and algorithms. In G. T. Toussaint, editor, Computational Morphology, pages 71-86. North-Holland, Amsterdam, Netherlands, 1988. 30, 35
11. A. Melkman and J. O'Rourke. On polygonal chain approximation. In G. T. Toussaint, editor, Computational Morphology, pages 87-95. North-Holland, Amsterdam, Netherlands, 1988. 30
12. E. A. Ramos. Linear optimization queries revisited. In Proc. 16th Annual ACM Symposium on Computational Geometry, pages 176-181, 2000. 33
13. Robert Weibel. Generalization of spatial data: principles and selected algorithms. In Marc van Kreveld, Jurg Nievergelt, Thomas Roos, and Peter Widmayer, editors, Algorithmic Foundations of Geographic Information System. Springer-Verlag Berlin Heidelberg New York, 1997. 30