Geometric computations by broadcasting automata on the integer grid

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Martin, R., Nickson, T., & Potapov, I. (2011). Geometric computations by broadcasting automata on the integer grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6714 LNCS, pp. 138–151). https://doi.org/10.1007/978-3-642-21341-0_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free