Some properties of higher order delaunay and gabriel graphs

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.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan, Maria Saumell
• Keywords: CCCG 2010, Computational Geometry, K-Delaunay Graph, K-Gabriel Graph, Order Proximity Graphs