Some properties of higher order delaunay and gabriel graphs

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010

Volumn , Issue , 2010, Pages 13-16

  Bose, Prosenjit ^a   Collette, Sébastien ^b,d   Hurtado, Ferran ^c   Korman, Matias ^b   Langerman, Stefan ^b,d   Sacristán, Vera ^c   Saumell, Maria ^c  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d Charge de recherches du FRS FNRS ^*  (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMATIC NUMBER; DELAUNAY; GABRIEL GRAPH; GEOMETRIC PROPERTIES; NUMBER OF LAYERS; PROXIMITY GRAPHS;

COMPUTATIONAL GEOMETRY;

GRAPHIC METHODS;

EID: 84882990375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. M. Abellanas, P. Bose, J. Garcia, F. Hurtado, C. M. Nicolas, and P. A. Ramos. On structural and graph theoretic properties of higher order Delaunay graphs. In- Ternat. J. Comput. Geom. Appl., 19(6):595-615, 2009.
2. M. Abellanas, F. Hurtado, and P. A. Ramos. Structural tolerance and Delaunay triangulation. Inform. Process. Lett., 71:221-227, 1999.
3. B. Abrego, R. Fabila-Monroy, S. Fernandez-Merchant, D. Flores-Penaloza, F. Hurtado, V. Sacristan, and M. Saumell. On crossing numbers of geometric proximity graphs. Manuscript, 2010. Abstract preliminary version in Proc. EGC'09, 151-156, 2009.
4. G. Araujo, A. Dumitrescu, F. Hurtado, M. Noy, and J. Urrutia. On the chromatic number of some geometric type Kneser graphs. Comput. Geom., 32(1):59-69, 2005.
5. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick. On the spanning ratio of Gabriel graphs and -skeletons. SIAM J. Discrete Math., 20(2):412-427, 2006.
6. P. Bose, L. Devroye, M. Loffer, J. Snoeyink, and V. Verma. The spanning ratio of the Delaunay triangulation is greater than π/2. Proc. CCCG'09, 165-167, 2009.
7. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001.
8. R. Diestel. Graph Theory. Springer-Verlag, 2005.
9. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom., 5:399-407, 1990.
10. J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80(9):1502-1517, 1992.
11. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom., 7(1):13-28, 1992.
12. A. V. Kostochka and J. Nesetril. Coloring relatives of intervals on the plane, I: chromatic number versus girth. Europ. J. Combinatorics, 19:103-110, 1998.
13. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. Proc. CCCG'99, 51-54, 1999.
14. J. W. Moon. On the diameter of a graph. Mich. Math. J., 12:349-351, 1965.
15. M. Saumell. On geometric proximity. Ph.D. thesis, in preparation.
16. T.-H. Su and R.-Ch. Chang. The k-Gabriel graphs and their applications. Proc. SIGAL'90, 66-75, 1990.