ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
From MaRDI portal
Publication:3405973
DOI10.1142/S0218195909003143zbMath1209.05199MaRDI QIDQ3405973
Prosenjit Bose, Manuel Abellanas, Jesús García-López, Carlos M. Nicolás, Ferran Hurtado, Pedro A. Ramos
Publication date: 12 February 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C75: Structural characterization of families of graphs
Related Items
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω, Hamiltonicity for convex shape Delaunay and Gabriel graphs, Coloring planar homothets and three-dimensional hypergraphs, On the number of higher order Delaunay triangulations, Decomposition of multiple coverings into more parts, On crossing numbers of geometric proximity graphs, Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs, Higher-order triangular-distance Delaunay graphs: graph-theoretical properties, Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs, The \(k\)-nearest-neighbor Voronoi diagram revisited, 10-Gabriel graphs are Hamiltonian, Matchings in higher-order Gabriel graphs, Flip graphs of bounded degree triangulations
Cites Work
- Toughness and Delaunay triangulations
- Generating realistic terrains with higher-order Delaunay triangulations
- Point set stratification and Delaunay depth
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Efficient perturbations for handling geometric degeneracies
- Higher order Delaunay triangulations
- Constrained higher order Delaunay triangulations
- Conflict-free coloring of points and simple regions in the plane
- Symbolic treatment of geometric degeneracies
