Some properties of higher order delaunay and gabriel graphs

2 years 6 months ago

Download www.cs.umanitoba.ca

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

Real-time Traffic

CCCG 2010 | Computational Geometry | K-Delaunay Graph | K-Gabriel Graph | Order Proximity Graphs |

claim paper

» Connections between ThetaGraphs Delaunay Triangulations and Orthogonal Surfaces

» Anisotropic Geodesics for Perceptual Grouping and Domain Meshing

» Efficient Belief Propagation with Learned HigherOrder Markov Random Fields

» An Explicit Framework for Interaction Nets

» Orthogonal Surfaces and Their CPOrders

Post Info
More Details (n/a)

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)

Sciweavers

Some properties of higher order delaunay and gabriel graphs

CCCG 2010 | Computational Geometry | K-Delaunay Graph | K-Gabriel Graph | Order Proximity Graphs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers