Polygonal approximation of closed contours

Authors:
Alexander Kolesnikov;Pasi Fränti
Affiliations:
Department of Computer Science, University of Joensuu, Joensuu, Finland;Department of Computer Science, University of Joensuu, Joensuu, Finland
Venue:
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Year:
2003

Citing 9
Cited 3

Optimum Uniform Piecewise Linear Approximation of Planar Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
Parallel approaches to piecewise linear approximation

Signal Processing
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Pattern Recognition Letters
A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters

An Algorithm for Binary Contour Objects Representation and Recognition

ICIAR '08 Proceedings of the 5th international conference on Image Analysis and Recognition
Data reduction of large vector graphics

Pattern Recognition
Polygonal approximation of digital planar curves through vertex betweenness

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal approximation of closed curves differs from the case of open curve in the sense that the location of the starting point must also be determined. Straightforward exhaustive search would take N times more time than the corresponding algorithm for open curve. We propose to approximate a cyclically extended contour of double size, and to select the best possible starting point by analyzing the state space. This takes only twice of the time required by the algorithm for open curve.