Optimal polygonal approximation of digital curves

Pattern Recognition

Volumn 28, Issue 3, 1995, Pages 373-379

  Pikaz, Arie ^a   Dinstein, Its'hak ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Breadth first search; City block metric; Optimal polygonal approximation

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; IMAGE ANALYSIS; IMAGE SEGMENTATION; OPTIMAL SYSTEMS; OPTIMIZATION;

BREADTH FIRST SEARCH; CITY BLOCK METRIC; DIGITAL CURVES; MINIMAL NUMBER OF VERTICES; OPTIMAL POLYGONAL APPROXIMATION;

ALGORITHMS;

EID: 0029263644     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(94)00108-X     Document Type: Article

References (25)

1. Some characterizations of the chessboard metric and the city block metric
2. Minimum-perimeter polygons of digitized silhouettes
3. Two algorithms for piecewise-linear continuous approximation of functions of one variable
4. An efficient algorithm for the piecewise linear approximation of planar curves
5. Fast polygonal approximation of digitized curves
6. 1 norm
7. Polygonal approximation to a digitized contour
8. A note on minimal length polygonal approximation to a digitized contour
9. An iterative procedure for the polygonal approximation of plane closed curves
10. A two-stae method of fitting conic arcs and straight-line segments to digitized contours
11. Segmentation of plane curves
12. Polygonal approximations by Newton's method
13. Some informational aspects of visual perception
14. Understanding shape angles and sides
15. The curvature primal sketch
16. Scale-based detection of corners of planar curves
17. Optimization piecewise linear approximation of planar curves
18. Computational-geometric methods for polygonal approximations of a curve
19. Piecewise linear approximation of plane curves by perimeter optimization
20. An optimal algorithm for the straight segment approximation of digital arcs
21. Processing and recognition of digital planar curves
22. A comparison of splitting methods for the identification of corner-points