Convex Hulls on Cellular Automata
Résumé
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.