Abstract
In this paper, we consider the minimum Chebyshev ∃ polygonal approximation problem. For this problem, we can use the plane sweep strategy to solve it in O(n2) time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. S. Chan and F. Chin “Approximation of Polygonal Curves with Minimum Number of Line Segments” International Symposium on Algorithms, JAPAN, 1992.
S. L. Hakimi and E. F. Schmeichel “Fitting Polygonal Functions to a Set of Points in the Plane” Computer Vision, Graphics and Image Processing: GRAPHICAL MODELS AND IMAGE PROCESSING Vol. 53, No. 2, pp 132–136 (1991).
F. P. Preparata and M. Shamos, Computational Geometry: An Introduction [1985].
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, D.P., Huang, N.F., Chao, H.S., Lee, R.C.T. (1993). Plane sweep algorithms for the polygonal approximation problems with applications. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_283
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_283
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive