论文信息 - Polygonal Approximations of a Curve — Formulations and Algorithms - 字舞流文

Polygonal Approximations of a Curve — Formulations and Algorithms

M. Iri | H. Imai

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

[2] Hiroshi Imai,et al. Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..

[3] S. Suri. A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

[4] D. Avis,et al. Simple On-Line Algorithms for Convex Polygons , 1985 .

[5] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .

[6] Yoshisuke Kurozumi,et al. Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[7] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[8] Dana H. Ballard,et al. Strip trees: a hierarchical representation for curves , 1981, CACM.

[9] Jack Sklansky,et al. Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[10] Franco P. Preparata,et al. An optimal real-time algorithm for planar convex hulls , 1979, CACM.

[11] Charles M. Williams,et al. An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

[12] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..