Abstract
We improve the time complexity to solve the polygonal curve approximation problem formulated by Imai and Iri from O(n 2 log n) to O(n 2). If the curve to be approximated forms part of a convex polygon, we show that the time complexity can be further reduced to O(n).
This research is partially supported by a UPGC Research Grant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.J. Burt. Fast filter transforms for image processing. Computer Graphics and Image Processing 16, pp. 20–51, 1981.
B.M. Chazelle. Computational Geometry and Convexity. Ph.D Thesis, Yale Univ., 1980.
F. Chin, A. Choi and Y. Luo. Optimal generating kernels for image pyramids by Linear fitting. In Proc. 1989 Int. Symp. on Computer Architecture and Digital Signal Processing (Hong Kong, Oct. 11–14, 1989), 612–617.
F. Chin, A. Choi and Y. Luo. Optimal generating kernels for image pyramids by Piecewise fitting. IEEE Trans. Pattern Anal. Machine Intell. (to appear).
L. Guibas, J. Hershberger, J. Mitchell and J.S. Snoeyink. Approximating Polygons and Subdivisions with Minimum Link Paths. Technical Report 92-5, University of British Columbia, March 1992.
S. L. Hakimi and E. F. Schmeichel. Fitting polygonal functions to a set of points in the plane. CVGIP, Graphical Models and Image Processing, Vol. 53 (1991), pp. 132–136.
H. Imai and M. Iri. Polygonal Approximations of a Curve-Formulations and Algorithms. In G. T. Toussaint, editor, Computational Morphology. North Holland, 1988
P. Meer, E.S. Baughter and A. Rosenfeld. Frequency domain analysis and synthesis of image pyramid generating kernels. IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 512–522, July 1987.
A. Melkman and J. O'Rourke. On Polygonal Chain Approximation. In G. T. Toussaint, editor, Computational Morphology. North Holland, 1988
A. Rosenfeld. (ed.) Multiresolution Image Processing and A nalysis. New York, Springer-Verlag, 1984.
G. T. Toussaint. On the Complexity of Approximating Polygonal Curves in the Plane. In Proc. IASTED, International Symposium on Robotics and Automation, Lugano, Switzerland, 1985
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, W.S., Chin, F. (1992). Approximation of polygonal curves with minimum number of line segments. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_90
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive