Sciweavers

Share
CCCG
2010

Some properties of higher order delaunay and gabriel graphs

3 years 10 months ago
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.
Prosenjit Bose, Sébastien Collette, Ferran
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where CCCG
Authors Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan, Maria Saumell
Comments (0)
books