Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences

Euclidean circle approximation on the square grid is an important problem in digital geometry. Recently several schemes have been proposed for approximation of Euclidean circles based on Neighbourhood Sequences, which correspond to repeated application of the von Neumann and Moore neighbourhoods on a square grid. In this paper we study polygon approximations of the Euclidean circles on the square grid with Broadcasting Sequences which can be seen as a generalization of Neighbourhood Sequences. The polygons generated by Broadcasting Sequences are the Minkowski sums of digital disks defined by a given set of broadcasting radii. We propose a polynomial time algorithm that can generate Broadcasting Sequences which are providing flexible and accurate approximation of Euclidean circles.

[1]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[2]  Igor Potapov,et al.  Broadcasting Automata and Patterns on Z^2 , 2014, ArXiv.

[3]  Azriel Rosenfeld,et al.  Digital straightness - a review , 2004, Discret. Appl. Math..

[4]  P. P. Das,et al.  Octagonal distances for digital pictures , 1990, Inf. Sci..

[5]  Jayanta Mukherjee.  On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension , 2011, Pattern Recognit. Lett..

[6]  Laurent Wendling,et al.  Fast polygonal approximation of digital curves , 2004, ICPR 2004.

[7]  Prashant Batra,et al.  Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra , 2008, CCA.

[8]  Partha Pratim Das,et al.  Distance functions in digital geometry , 1987, Inf. Sci..

[9]  Donghui Chen,et al.  Nonnegativity constraints in numerical analysis , 2009, The Birth of Numerical Analysis.

[10]  Partha Bhowmick,et al.  Approximation of Digital Circles by Regular Polygons , 2005, ICAPR.

[11]  David Peleg,et al.  Distributed algorithms for partitioning a swarm of autonomous mobile robots , 2009, Theor. Comput. Sci..

[12]  Igor Potapov,et al.  Geometric computations by broadcasting automata , 2012, Natural Computing.

[13]  János Farkas,et al.  Approximating the Euclidean circle in the square grid using neighbourhood sequences , 2010, ArXiv.

[14]  Robin Strand,et al.  Distance Functions Based on Multiple Types of Weighted Steps Combined with Neighborhood Sequences , 2018, Journal of Mathematical Imaging and Vision.

[15]  Marcel Worring,et al.  Digitized Circular Arcs: Characterization and Parameter Estimation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Orizon Pereira Ferreira,et al.  Local convergence of Newton's method under majorant condition , 2010, J. Comput. Appl. Math..

[17]  Benedek Nagy,et al.  On the Chamfer Polygons on the Triangular Grid , 2017, IWCIA.

[18]  Robin Strand,et al.  Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid , 2011, Theor. Comput. Sci..