1 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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bhowmick, P., & Bhattacharya, B. B. (2005). Approximation of digital circles by regular polygons. In Lecture Notes in Computer Science (Vol. 3686, pp. 257–267). Springer Verlag. https://doi.org/10.1007/11551188_28
Mendeley helps you to discover research relevant for your work.