Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Optimal polygonal approximation of digitized curves
Proceedings of the 17th meeting of the Austrian Association for pattern recognition on Image analysis and synthesis
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Decomposition of Digital Curves into Polygons Using the Haar Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Polygonal Approximation of Digital Curves
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Approximate Fingerprint Matching Using Kd-Tree
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Piecewise Polygonal Approximation of Digital Curves
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Number-theoretic interpretation and construction of a digital circle
Discrete Applied Mathematics
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
Digital Circularity and Its Applications
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
| Hi-index | 0.01 |
In this paper, we show that an ideal regular (convex) polygon corresponding to a digital circle is possible for some of the digital circles, especially for the ones having smaller radii. For a circle whose ideal regular polygon is not possible, an approximate polygon, tending to the ideal one, is possible, in which the error of approximation can be controlled by the number of vertices of the approximate polygon. These (ideal or approximate) polygonal enclosures of digital circles have several applications in approximate point set pattern matching. We have reported the conditions under which an ideal regular polygon definitely exists corresponding to a digital circle, and the conditions under which the existence of an ideal regular polygon becomes uncertain. Experimental results have been given to exhibit the possibilities of approximation and the tradeoff in terms of error versus approximation.