Abstract
Gabriel graphs are subgraphs of Delaunay graphs that are used in many domains such as sensor networks and computer graphics. Although very useful in their original form, their definition is bounded to applications involving Euclidean spaces only, but their principles seem to be applicable to a wider range of applications. In this article, we generalize this construct and define metric Gabriel graphs that transport the principles of Gabriel graphs on arbitrary metric space, allowing their use in domains like cellular automata and amorphous computing, or any other domains where a non-Euclidean metric is used. We study global/local properties of metric Gabriel graphs and use them to design a cellular automaton that draws the metric Gabriel graph of its input. This cellular automaton only uses seven states to achieve this goal and has been tested on hexagonal grids, 4-connected, and 8-connected square grids.
- Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight, T. F. J., Nagpal, R., Rauch, E., Sussman, G. J., and Weiss, R. 2000. Amorphous computing. Commun. ACM 43, 5, 74--82. Google Scholar
Digital Library
- Adamatzky, A. 1996. Voronoi-like partition of lattice in cellular automata. Math. Comput. Model. 23, 51--66. Google Scholar
Digital Library
- Aupetit, M. and Catz, T. 2005. High-dimensional labeled data analysis with topology representing graphs. Neurocomput. 63, 139--169. Google Scholar
Digital Library
- Aurenhammer, F. 1991. Voronoi diagrams -- A survey of a fundamental geometric data structure. ACM Comput. Surv. 23, 3, 345--405. Google Scholar
Digital Library
- Bachrach, J., Beal, J., Horowitz, J., and Qumsiyeh, D. 2008. Empirical characterization of discretization error in gradient-based algorithms. In Proceedings of the 2nd IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO’08). IEEE, Los Alamitos, CA, 203--212. Google Scholar
Digital Library
- Beal, J., Bachrach, J., Vickery, D., and Tobenkin, M. 2009. Fast self-stabilization for gradients. In Proceedings of the International Conference on Distributed Computing in Sensor Systems (DCOSS). B. Krishnamachari et al. Eds., Lecture Notes in Computer Science, vol. 5516. Springer, Berlin, 15--27. Google Scholar
Digital Library
- Chen, H. and Wei, W. 2006. Geodesic Gabriel graph-based supervised nonlinear manifold learning. In Intelligent Computing in Signal Processing and Pattern Recognition. Lecture Note in Control and Information Sciences, Vol. 345. Springer, Berlin, 882--887.Google Scholar
- Chopard, B. and Droz, M. 1998. Cellular Automata Modeling of Physical Systems. Cambridge University Press.Google Scholar
- Coore, D. N. 1999. Botanical computing: A developmental approach to generating interconnect topologies on an amorphous computer. Ph.D. dissertation. Google Scholar
Digital Library
- Gross, J. L. and Yellen, J. 2003. Handbook of Graph Theory (Discrete Mathematics and Its Applications). CRC Press.Google Scholar
- Gabriel, R. K. and Sokal, R. R. 1969. A new statistical approach to geographic variation analysis. Systematic Zoology 18, 3, 259--278.Google Scholar
Cross Ref
- Jaromczyk, J. W. and Toussaint, G. T. 1992. Relative neighborhood graphs and their relatives. Proc. IEEE. 1502--1517.Google Scholar
- Kanj, I. A., Perkovic, L., and Xia, G. 2009. Local construction of near-optimal power spanners for wireless ad hoc networks. IEEE Trans. Mobile Comput. 8, 4, 460--474. Google Scholar
Digital Library
- Lee, C., Kim, D., Shin, H., and Kim, D.-S. 2006. Efficient computation of elliptic Gabriel graph. In Proceedings of the International Conference on Computational Science and Its Application (ICCSA). 440--448. Google Scholar
Digital Library
- Maignan, L. 2007. Uniformisation de la répartition spatiale d’un ensemble de points par diagramme de Voronoï: Implémentation sur automate cellulaire. M.S. thesis, Universite Paris XI.Google Scholar
- Maignan, L. and Gruau, F. 2008. Integer gradient for cellular automata: Principle and examples. In Proceedings of the Spatial Computing Workshop at IEEE SASO’08. Google Scholar
Digital Library
- Maniatty, W. A. and Szymanski, B. K. 1997. Fine-grain discrete Voronoi diagram algorithms in L1 and L1 norms. Math. Comput. Model. 26, 8, 71--78. Google Scholar
Digital Library
- Mukherjee, K. 2004. Application of the Gabriel graph to instance based learning algorithms. M.S. thesis, SFU CS School.Google Scholar
- Nagpal, R. 2002. Programmable self-assembly using biologically-inspired multiagent control. In Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’02). ACM, New York, 418--425. Google Scholar
Digital Library
- Park, J. C., Shin, H., and Choi, B. K. 2006. Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimation. Comput.-Aid Des. 38, 6, 619--626. Google Scholar
Digital Library
- Toffoli, T. and Margolus, N. 1987. Cellular Automata Machines, A New Environment for Modeling. The MIT Press, Cambridge, MA. Google Scholar
Digital Library
Index Terms
Gabriel Graphs in Arbitrary Metric Space and their Cellular Automaton for Many Grids
Recommendations
10-Gabriel graphs are Hamiltonian
We prove that the 10-Gabriel graph of any set of points is Hamiltonian.We discuss a possible way to further improve upon the previous result.We show that there exist sets of points whose 1-Gabriel graph is not Hamiltonian. Given a set S of points in the ...
On Locally Gabriel Geometric Graphs
Let $$P$$P be a set of $$n$$n points in the plane. A geometric graph $$G$$G on $$P$$P is said to be locally Gabriel if for every edge $$(u,v)$$(u,v) in $$G$$G, the Euclidean disk with the segment joining $$u$$u and $$v$$v as diameter does not contain ...
Matchings in higher-order Gabriel graphs
Given a set P of n points in the plane, the order-k Gabriel graph on P, denoted by k - GG , has an edge between two points p and q if and only if the closed disk with diameter pq contains at most k points of P, excluding p and q. We study matching ...






Comments