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
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polygonal approximation by boundary reduction
Pattern Recognition Letters
A non-parametric sequential method for polygonal approximation of digital curves
Pattern Recognition Letters
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
An algorithm for polygonal approximation based on iterative point elimination
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new method for polygonal approximation using genetic algorithms
Pattern Recognition Letters
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
An efficient algorithm for the optimal polygonal approximation of digitized curves
Pattern Recognition Letters
On Critical Point Detection of Digital Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improving fitting quality of polygonal approximation by using the dynamic programming technique
Pattern Recognition Letters
Pattern Recognition Letters
Bidimensional Shapes Polygonalization by ACO
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Multiresolution Polygonal Approximation of Digital Curves
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Data reduction of large vector graphics
Pattern Recognition
Variable-resolution Compression of Vector Data
Geoinformatica
A discrete geometry approach for dominant point detection
Pattern Recognition
Segmentation and multi-model approximation of digital curves
Pattern Recognition Letters
ISE-bounded polygonal approximation of digital curves
Pattern Recognition Letters
A non-heuristic dominant point detection based on suppression of break points
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
A novel framework for making dominant point detection methods non-parametric
Image and Vision Computing
| Hi-index | 0.04 |
Optimal polygonal 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 optimal algorithm for an open curve, because there are N possible points to be considered as the starting point. Faster sub-optimal solution can be found by iterating the search and heuristically selecting different starting point at each iteration. In this paper, we propose to find the optimal approximation of a cyclically extended closed curve of double size, and to select the best possible starting point by search in the extended search space for the curve. The proposed approach provides solution very close to the optimal one using at most twice as much time as required by the optimal algorithm for the corresponding open curve.