On structural and graph theoretic properties of higher order Delaunay graphs
From MaRDI portal
Publication:3405973
DOI10.1142/S0218195909003143zbMATH Open1209.05199MaRDI QIDQ3405973FDOQ3405973
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)
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\)}
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Structural characterization of families of graphs (05C75)
Cites Work
- Toughness and Delaunay triangulations
- Conflict-free coloring of points and simple regions in the plane
- Higher order Delaunay triangulations
- Generating realistic terrains with higher-order Delaunay triangulations
- Constrained higher order Delaunay triangulations
- Efficient perturbations for handling geometric degeneracies
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Symbolic treatment of geometric degeneracies
- Point set stratification and Delaunay depth
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)
