1 |
S.L. Hakimi and E.F. Schmeichel, 'Fitting polygonal functions to a set of points in the plane', Computer Vision, Graphics, and Image Processing, vol. 53, pp. 132-136, 1991
|
2 |
H. Imai and M. Iri, 'Computational-geometric methods for polygonal approximations of a curve', Computer Vision, Graphics, and Image Processing, vol. 36, pp. 31-41, 1986
DOI
|
3 |
G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, and J. Snoeyink, 'Efficiently approximating polygonal paths in three and higher dimensions', Pro. 14th Annual ACM Symp. on Computational Geometry, pp. 317-326, 1998
|
4 |
D.Z. Chen and O. Daescu, 'Space-efficient algorithms for approximating polygonal curves in two-dimensional space', The 4th Annual Int. Computing and Combinatorics Conference, pp. 45-54, 1998
DOI
ScienceOn
|
5 |
F.P. Preparata and M.I. Shamos, 'Computational geometry: An introduction', Springer-Verlag, 1985
|
6 |
W.S. Chan and F. Chin, 'Approximation of polygonal curves with minimum number of line segments or minimum error', Int. J. of Computational Geometry and Applications, vol. 6(1), pp. 59-77, 1996
DOI
|
7 |
A. Melkman and J. O'Rourks, 'On polygonal chain approximation', Computational Morphology, pp. 87-95, 1988
|
8 |
K.R. Varadarajan, 'Approximating monotone polygonal curves using the uniform metric', Pro. 12th Annual ACM Symp. on Computational Geometry, pp. 311-318, 1996
|