Optimal polygonal approximation of digitised curves

IEE Proceedings: Vision, Image and Signal Processing

Volumn 144, Issue 1, 1997, Pages 8-14

  Zhu, Y ^a   Seneviratne, L D ^b  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Curve fitting; Digitised polygonal curves

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; PARAMETER ESTIMATION;

OPTIMAL POLYGONAL APPROXIMATION; POLYGONAL CURVE FITTING;

CURVE FITTING;

EID: 0031072834     PISSN: 1350245X     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-vis:19970985     Document Type: Article

References (19)

1. DUNHAM, J.G.: 'Optimum uniform piecewise linear approximation of planar curves', IEEE Trans., 1986, PAMI-8, pp. 67-75
2. SKLANSKY, J., and GONZALEZ, V.: 'Fast polygonal approximation of digitized curves', Pattern Recognit., 1980, 12, pp. 327-331
3. PAVLIDIS, T.: 'Algorithms for shape analysis of contours and waveforms', IEEE Trans., 1980, PAMI-2, (4), pp. 301-312
4. WILLIAMS, C.M.: 'Bounded straight-line approximation of digitized planar curves and lines', Comput. Graph. Image Process., 1981, 16, pp. 370-381
5. MONTANARI, U.: 'A note on minimal length polygonal approximation to a digitized contour', Commun. ACM, 1970, 13, pp. 41-47
6. SATO, Y.: 'Piecewise linear approximation of plane curves by perimeter optimization', Pattern Recognit., 1992, 25, (12), pp. 1535-1543
7. PAVLIDIS, T.: 'Structural pattern recognition' (Springer, New York, 1977)
8. KUROZUMI, Y., and DAVIS, W.A.: 'Polygonal approximation by the minimax method', Comput. Graph. Image Process., 1982, 19, pp. 248-264
9. DUDA, R.O., and HART, P.E.: 'Pattern classification and scene analysis' (Wiley, New York, 1973)
10. PAVLIDIS, T.: 'Algorithms for graphics and image processing' (Springer, New York, 1981)
11. SHIRAI, Y.: 'Three-dimensional computer vision' (Springer-Verlag, New York, 1987)
12. IMAI, H., and IRI, M.: 'Computational-geometric methods for polygonal approximations of a curve', Comput. Vis. Graph. Image Process., 1986, 36, pp. 31-41
13. WILLIAMS, C.M.: 'An efficient algorithm for the piecewise linear approximation of planar curves', Comput. Graph. Image Process., 1978, 8, pp. 286-293
14. BELLMAN, R.: 'On the approximation of curves by line segments using dynamic programming', Commun. ACM, 1961, 4, pp. 284
15. ROBERGE, J.: 'A data reduction algorithm for planar curves', Comput. Vis. Graph. Image Process., 1985, 29, pp. 168-195
16. WALL, K., and DANIELSON, P.-E.: 'A fast sequential method for polygonal approximation of digitized curves', Comput. Vis. Graph. Image Process., 1984, 28, pp. 220-227
17. SHARAIHA, Y., and CHRISTOFIDES, N.: 'An optimal algorithm for the straight segment approximation of digital arcs', CVGIP: Graph. Models Image Process., 1993, 55, (5), pp. 397-407
18. PIKAZ, A., and DINSTEIN, I.: 'Optimal polygonal approximation of digital curves'. Proceedings of 12th IAPR international conference on Pattern recognition, Jerusalem, Israel, 1994, Vol. 1, pp. 619-621
19. PEREZ, J.C., and VIDAL, E.: 'Optimum polygonal approximation of digitized curves', Pattern Recognit. Lett., 1994, 15, pp. 743-750