Some properties of higher order delaunay and gabriel graphs

Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross.

Original languageEnglish
Pages13-16
Number of pages4
Publication statusPublished - 2010 Dec 1
Externally publishedYes
Event22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 - Winnipeg, MB, Canada
Duration: 2010 Aug 92010 Aug 11

Other

Other22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
CountryCanada
CityWinnipeg, MB
Period10/8/910/8/11

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Fingerprint Dive into the research topics of 'Some properties of higher order delaunay and gabriel graphs'. Together they form a unique fingerprint.

  • Cite this

    Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., & Saumell, M. (2010). Some properties of higher order delaunay and gabriel graphs. 13-16. Paper presented at 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010, Winnipeg, MB, Canada.