Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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-9
Aupetit, M., Catz, T.: High-dimensional labeled data analysis with topology representing graphs. Neurocomputing 63, 139–169 (2005)
Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv. 23(3), 345–405 (1991), http://doi.acm.org/10.1145/116873.116880
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)
Clarridge, A.G., Salomaa, K.: An improved cellular automata based algorithm for the 45-convex hull problem. Journal of Cellular Automata 5(1-2), 107–120 (2010)
Gabriel, R.K., Sokal, R.R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18(3), 259–278 (1969)
Ilachinski, A.: Cellular Automata: A Discrete Universe. World Scientific Publishing Co., Inc., River Edge (2001)
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
Lee, C., Kim, D.-U., Shin, H., Kim, D.-S.: Efficient computation of elliptic Gabriel graph. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3980, pp. 440–448. Springer, Heidelberg (2006)
Maignan, L., Gruau, F.: Integer gradient for cellular automata: Principle and examples. In: Spatial Computing Workshop at IEEE SASO 2008 (2008)
Maignan, L., Gruau, F.: Gabriel graphs in arbitrary metric space and their cellular automaton for many grids. ACM Trans. Auton. Adapt. Syst. (2010)
Mukherjee, K.: Application of the Gabriel graph to instance based learning algorithms. Master’s thesis, SFU CS School (2004)
Park, J.C., Shin, H., Choi, B.K.: Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimation. Computer-Aided Design 38(6), 619–626 (2006)
Torbey, S., Akl, S.G.: An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem. J. Cellular Automata 4(2), 137–146 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Maignan, L., Gruau, F. (2014). Convex Hulls and Metric Gabriel Graphs. In: Rosin, P., Adamatzky, A., Sun, X. (eds) Cellular Automata in Image Processing and Geometry. Emergence, Complexity and Computation, vol 10. Springer, Cham. https://doi.org/10.1007/978-3-319-06431-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-06431-4_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06430-7
Online ISBN: 978-3-319-06431-4
eBook Packages: EngineeringEngineering (R0)