Broadcasting Automata and Patterns on Z^2

The recently introduced Broadcasting Automata model draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood sequences and nature, employing many of the same pattern forming methods that can be seen in the superposition of waves and resonance. Algorithms for the broadcasting automata model are in the same vain as those encountered in distributed algorithms using a simple notion of waves, messages passed from automata to automata throughout the topology, to construct computations. The waves generated by activating processes in a digital environment can be used for designing a variety of wave algorithms. In this chapter we aim to study the geometrical shapes of informational waves on integer grid generated in broadcasting automata model as well as their potential use for metric approximation in a discrete space. An exploration of the ability to vary the broadcasting radius of each node leads to results of categorisations of digital discs, their form, composition, encodings and generation. Results pertaining to the nodal patterns generated by arbitrary transmission radii on the plane are exploredwith a connection to broadcasting sequences and approximation of discrete metrics of which results are given for the approximation of astroids, a previously unachievable concave metric, through a novel application of the aggregation of waves via a number of explored functions.

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

[2]  Peter Linz,et al.  An Introduction to Formal Languages and Automata , 1997 .

[3]  J. Tyson,et al.  A cellular automaton model of excitable media. II: curvature, dispersion, rotating waves and meandering waves , 1990 .

[4]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

[5]  Jarkko Kari,et al.  Theory of cellular automata: A survey , 2005, Theor. Comput. Sci..

[6]  Hermann von Baravalle,et al.  CLASSICS IN MATHEMATICS EDUCATION , 2016 .

[7]  Rolf Schneider,et al.  Convex Bodies: The Brunn–Minkowski Theory: Selected applications , 1993 .

[8]  J. Tyson,et al.  A cellular automaton model of excitable media. III: fitting the Belousov-Zhabotinskiic reaction , 1990 .

[9]  Imre Brny LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) By JI MATOUEK: 481 pp., 31.50 (US$39.95), ISBN 0-387-95374-4 (Springer, New York, 2002). , 2003 .

[10]  Jack Bresenham,et al.  A linear algorithm for incremental digital display of circular arcs , 1977, CACM.

[11]  R. Yates,et al.  Curves and their properties , 1974 .

[12]  Ken Moody An Introduction to Formal Languages and Automata , 1992 .

[13]  Masafumi Yamashita,et al.  Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..

[14]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[15]  Jacques Mazoyer,et al.  An Overview of the Firing Squad Synchronization Problem , 1986, Automata Networks.

[16]  Nak Young Chong,et al.  A Mobile Sensor Network Forming Concentric Circles Through Local Interaction and Consensus Building , 2009, J. Robotics Mechatronics.

[17]  Nak Young Chong,et al.  A geometric approach to deploying robot swarms , 2008, Annals of Mathematics and Artificial Intelligence.

[18]  Partha Pratim Das,et al.  Generalized distances in digital geometry , 1987, Inf. Sci..

[19]  Ralph Duncan,et al.  A survey of parallel computer architectures , 1990, Computer.

[20]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[21]  András Hajdu,et al.  Approximating the Euclidean distance using non-periodic neighbourhood sequences , 2004, Discret. Math..

[22]  J. Conway Regular algebra and finite machines , 1971 .

[23]  András Hajdu Geometry of neighbourhood sequences , 2003, Pattern Recognit. Lett..

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

[25]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[26]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[27]  Robin Strand,et al.  Approximating Euclidean Distance Using Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids , 2006, IWCIA.

[28]  Konrad Polthier,et al.  Combinatorial Image Analysis , 2014, Lecture Notes in Computer Science.

[29]  Igor Potapov,et al.  Geometric Computations by Broadcasting Automata on the Integer Grid , 2011, UC.

[30]  Partha Bhowmick,et al.  Number-theoretic interpretation and construction of a digital circle , 2008, Discret. Appl. Math..

[31]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[32]  A. Su,et al.  The National Council of Teachers of Mathematics , 1932, The Mathematical Gazette.

[33]  B. Nagy Metric and non-metric distances on Z/sup n/ by generalized neighbourhood sequences , 2005, ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005..

[34]  K. Ball CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[35]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[36]  R. Leighton,et al.  The Feynman Lectures on Physics; Vol. I , 1965 .

[37]  A. Thiaville,et al.  Extensions of the geometric solution of the two dimensional coherent magnetization rotation model , 1998 .