On structural and graph theoretic properties of higher order Delaunay graphs

DOI10.1142/S0218195909003143MaRDI QIDQ3405973zbMATH OpenFDO

Authors Manuel Abellanas, Prosenjit Bose, J. García-López, Ferran Hurtado, Carlos M. Nicolás, Pedro Ramos

Publication date 12 February 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

geometric graphsDelaunay graphhigher order proximity graphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Structural characterization of families of graphs (05C75)

Recommendations

• Some properties of k-Delaunay and k-Gabriel graphs
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}

Cites work

• Conflict-free coloring of points and simple regions in the plane
• Constrained higher order Delaunay triangulations
• Efficient perturbations for handling geometric degeneracies
• Generating realistic terrains with higher-order Delaunay triangulations
• Higher order Delaunay triangulations
• Point set stratification and Delaunay depth
• Symbolic treatment of geometric degeneracies
• Toughness and Delaunay triangulations
• Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations

Cited in

(16)

• Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
• Matchings in higher-order Gabriel graphs
• Some properties of k-Delaunay and k-Gabriel graphs
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs
• On the number of higher order Delaunay triangulations
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• Flip graphs of bounded degree triangulations
• Decomposition of multiple coverings into more parts
• The \(k\)-nearest-neighbor Voronoi diagram revisited
• On crossing numbers of geometric proximity graphs
• Coloring certain proximity graphs
• On locally Delaunay geometric graphs
• Coloring planar homothets and three-dimensional hypergraphs
• 10-Gabriel graphs are Hamiltonian

This page was built for publication: On structural and graph theoretic properties of higher order Delaunay graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405973)