Geometric computations by broadcasting automata

摘要

In this paper we introduce and apply a novel approach for self-organisation, 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 this model automata cannot directly observe their neighbours' state and can only communicate with neighbouring automata through the non-oriented broadcast of messages from a finite alphabet. 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. Possible generalizations and applications of techniques based on nodal patterns and the construction of different discrete wave interference pictures are discussed in the conclusion.