Abstract
We consider the problem of approximating a polygonal curve P under a given error criterion by another polygonal curve P’ whose vertices are a subset of the vertices of P. The goal is to minimize the number of vertices of P’ while ensuring that the error between P’ and P is below a certain threshold. We consider two fundamentally different error measures — Hausdor. and Fréchet error measures. For both error criteria, we present near-linear time approximation algorithms that, given a parameter ε > 0, compute a simplified polygonal curve P’ whose error is less than ε and size at most the size of an optimal simplified polygonal curve with error ε/2. We consider monotone curves in the case of Hausdorff error measure and arbitrary curves for the Fréchet error measure. We present experimental results demonstrating that our algorithms are simple and fast, and produce close to optimal simplifications in practice.
Research by the first, the third and the fourth authors is supported by NSF grants ITR-333-1050, EIA-98-70724, EIA-01-31905, CCR-97-32787, and CCR-00-86013. Research by second author is partially supported by a NSF CAREER award CCR- 0132901.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Alt and M. Godeau. Computing the frechet distance between two polygonal curves. International Journal of Computational Geometry, pages 75–91, 1995.
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.
P.K. Agarwal and K.R. Varadarajan. Efficient algorithms for approximating polygonal chains. Discrete Comput. Geom., 23:273–291, 2000.
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.
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.
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.
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.
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.
H. Imai and M. Iri. An optimal algorithm for approximating a piecewise linear function. Information Processing Letters, 9(3):159–162, 1986.
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.
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.
E.A. Ramos. Linear optimization queries revisited. In Proc. 16th Annual ACM Symposium on Computational Geometry, pages 176–181, 2000.
Robert Weibel. Generalization of spatial data: principles and selected algorithms. In Marc van Kreveld, Jürg Nievergelt, Thomas Roos, and Peter Widmayer, editors, Algorithmic Foundations of Geographic Information System. Springer-Verlag Berlin Heidelberg New York, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agarwal, P.K., Har-Peled, S., Mustafa, N.H., Wang, Y. (2002). Near-Linear Time Approximation Algorithms for Curve Simplification. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive