Polygonal approximation by the minimax method

Computer Graphics and Image Processing

Volumn 19, Issue 3, 1982, Pages 248-264

  Kurozumi, Yoshisuke ^a   Davis, Wayne A ^b  

^a KYOTO SANGYO UNIVERSITY   (Japan)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES;

PATTERN RECOGNITION SYSTEMS;

EID: 0020336351     PISSN: 0146664X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0146-664X(82)90011-9     Document Type: Article

References (25)

1. Algorithms for shape analysis of contours and waveforms
2. A geometric method for approximating convex arc
3. Fast polygonal approximation of digitized curves
4. An efficient algorithm for the piecewise linear approximation of planar curves
5. Polygonal approximations by Newton's method
6. A theory of nonuniformity digitized binary pictures
7. Segmentation of planar curve
8. Nonlinear segmented function approximation and analysis of line patterns
9. Two algorithms for piecewise linear continuous approximations of functions of one variable
10. Segmentation of plane curves
11. Waveform segmentation through functional approximation
12. Minimum perimeter polygons of digitized silhouettes
13. An iterative procedure for the polygonal approximation of plane curves
14. Optimal curve-fitting with piecewise linear functions
15. A note on minimal length polygonal approximation to a digitized contour
16. Recognition of convex blobs
17. On quantization of line-drawing data
18. A line segment curve-fitting algorithm related to optimal encoding of information
19. Further remarks on line segment curve-fitting using dynamic programming
20. Approximation of curves by line segments
21. On the approximation of curves by line segments using dynamic programming