Some properties of higher order delaunay and gabriel graphs
Document typeConference report
Rights accessOpen Access
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.
CitationBose, P. [et al.]. Some properties of higher order delaunay and gabriel graphs. A: Canadian Conference on Computational Geometry. "22nd Canadian Conference on Computational Geometry". Winnipeg: 2010, p. 13-16.