论文信息 - Approximation of Polygonal Curves with Minimum Number of Line Segments

Approximation of Polygonal Curves with Minimum Number of Line Segments

We improve the time complexity to solve the polygonal curve approximation problem formulated by Imai and Iri from O(n2 log n) to O(n2). 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).

[1] A. Melkman,et al. On Polygonal Chain Approximation , 1988 .

[2] Leonidas J. Guibas,et al. Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, ISA.

[3] Azriel Rosenfeld,et al. Multiresolution image processing and analysis , 1984 .

[4] S. Louis Hakimi,et al. Fitting polygonal functions to a set of points in the plane , 1991, CVGIP Graph. Model. Image Process..

[5] P. Burt. Fast filter transform for image processing , 1981 .

[6] B. Chazelle. Computational geometry and convexity , 1980 .

[7] Yuhua Luo,et al. Optimal Generating Kernels for Image Pyramids by Piecewise Fitting , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[8] P. J. Burt,et al. Fast Filter Transforms for Image Processing , 1981 .

[9] M. Iri,et al. Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[10] Azriel Rosenfeld,et al. Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.