Geometric Computations by Broadcasting Automata on the Integer Grid
In this paper we introduce and apply a novel approach for self-organization, partitioning and pattern formation on the non-oriented grid environment. The method is based on the generation of nodal patterns in the environment via sequences of discrete waves. The power of the primitives is illustrated by giving solutions to two geometric problems using the broadcast automata model arranged in an integer grid (a square lattice) formation. In particular we show linear time algorithms for: the problem of finding the centre of a digital disk starting from any point on the border of the disc and the problem of electing a set of automata that form the inscribed square of such a digital disk.
KeywordsGeometric Computation Nodal Line Constant Delay Discrete Time Step Transmission Radius
Unable to display preview. Download preview PDF.
- 1.Alderighi, S., Mazzei, T.: Broadcast Automata: a Parallel Scalable Architecture for Prototypal Embedded Processors for Space Applications. HICSS (5), 208–217 (1997)Google Scholar
- 5.Lee, G., Chong, N.: A geometric approach to deploying robot swarms. Annals of Mathematics and Artificial Intelligence, 257–280 (2008)Google Scholar
- 6.Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334 (2005)Google Scholar
- 7.Standing Waves (January 2010), http://en.wikipedia.org/wiki/Standing_wave