Skip to Main content Skip to Navigation
Conference papers

Convex Hulls on Cellular Automata

Luidnel Maignan 1, * Frédéric Gruau 2, 3 
* Corresponding author
1 ALCHEMY - Architectures, Languages and Compilers to Harness the End of Moore Years
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
2 LIRMM/HE - Hors Équipe
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In the cellular automata domain, the discrete convex hull computation rules proposed until now only deal with a connected set of seeds in infinite space, or with distant set of seeds in finite space. We present a cellular automata rule that constructs the discrete convex hull of arbitrary set of seeds in infinite spaces. The rule is expressed using intrinsic and general properties of the cellular spaces, considering them as metric spaces. In particular, this rule is a direct application of metric Gabriel graphs. This allows the rule and its components to be used on all common 2D and 3D grids used in cellular automata.
Complete list of metadata
Contributor : Frederic Gruau Connect in order to contact the contributor
Submitted on : Monday, November 29, 2010 - 11:07:01 PM
Last modification on : Friday, August 5, 2022 - 10:45:57 AM


  • HAL Id : inria-00541144, version 1


Luidnel Maignan, Frédéric Gruau. Convex Hulls on Cellular Automata. ACRI: Cellular Automata for Research and Industry, Sep 2010, Ascoli Piceno, Italy. ⟨inria-00541144⟩



Record views