Convex Hulls and Metric Gabriel Graphs
The convex hulls construction is mostly known from the point of view of 2D Euclidean geometry where it associates to a given set of points called seeds, the smallest convex polygon containing these seeds. For the cellular automata case, different adaptations of the definition and associated constructions have been proposed to fit with the discreteness of the cellular spaces. We review some of these propositions and show the link with the famous majority and voting rules. We then unify all these definitions in a unique framework using metric spaces and provide a general solution to the problem. This will lead us to an understanding of the convex hull construction as a chase for shortest paths. This emphases the importance of Voronoï diagrams and its related proximity graphs: Delaunay and Gabriel graphs. Indeed, the central problem to be solved is that of connecting arbitrary sets of seeds, in a local and finite-state way, while remaining inside the desired convex hull, i.e by shortest paths. This is exactly what will be made possible by a suitable generalization of Gabriel graphs from Euclidean to arbitrary metric spaces and the study of its construction by cellular automata. The general solution therefore consists of two levels: a connecting level using the metric Gabriel graphs and a level completing the convex hull locally as the majority rule does. Both levels can be generalized to compute the convex hull, when the seeds are moving.
KeywordsShort Path Convex Hull Cellular Automaton Majority Rule Vote Rule
Unable to display preview. Download preview PDF.
- 1.Adamatzky, A.: Voronoi-like partition of lattice in cellular automata. Mathematical and Computer Modelling 23, 51–66 (1996), doi:doi:10.1016/0895-7177(96)00003-9Google Scholar
- 4.Chen, H., Wei, W.: Geodesic Gabriel graph based supervised nonlinear manifold learning. In: Huang, D.-S., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCIS, vol. 345, pp. 882–887. Springer, Heidelberg (2006)Google Scholar
- 7.Ilachinski, A.: Cellular Automata: A Discrete Universe. World Scientific Publishing Co., Inc., River Edge (2001)Google Scholar
- 8.Kanj, I.A., Perković, L., Xia, G.: Local construction of near-optimal power spanners for wireless ad hoc networks. IEEE Transactions on Mobile Computing 8(4), 460–474 (2009), http://doi.ieeecomputersociety.org/10.1109/TMC.2008.132 CrossRefGoogle Scholar
- 10.Maignan, L., Gruau, F.: Integer gradient for cellular automata: Principle and examples. In: Spatial Computing Workshop at IEEE SASO 2008 (2008)Google Scholar
- 11.Maignan, L., Gruau, F.: Gabriel graphs in arbitrary metric space and their cellular automaton for many grids. ACM Trans. Auton. Adapt. Syst. (2010)Google Scholar
- 12.Mukherjee, K.: Application of the Gabriel graph to instance based learning algorithms. Master’s thesis, SFU CS School (2004)Google Scholar