Toughness and Delaunay triangulations
From MaRDI portal
Publication:803161
Recommendations
- A short proof of the toughness of Delaunay triangulations
- Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
- Graph-theoretical conditions for inscribability and Delaunay realizability
- A uniqueness theorem for Delaunay graphs
- Structural tolerance and Delaunay triangulation
Cites work
- scientific article; zbMATH DE number 3912424 (Why is no real title available?)
- scientific article; zbMATH DE number 4025481 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 3668667 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 140458 (Why is no real title available?)
- scientific article; zbMATH DE number 5522 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3289061 (Why is no real title available?)
- scientific article; zbMATH DE number 3070904 (Why is no real title available?)
- A 1-tough nonhamiltonian maximal planar graph
- A non-Hamiltonian, nondegenerate Delaunay triangulation
- A note on Delaunay and optimal triangulations
- A theorem on graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- An upper bound on the shortness exponent of inscribable polytopes
- Connect-the-dots: A new heuristic
- Delaunay graphs are almost as good as complete graphs
- Generalized Dirichlet tesselations
- Graph theory with applications
- Hamiltonian circuits on 3-polytopes
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
- On sorting triangles in a Delaunay tessellation
- On the average length of Delaunay triangulations
- Realizability of Delaunay triangulations
- Recognizing Dirichlet tesselations
- Recognizing tough graphs is NP-hard
- Some problems in computational geometry
- Some problems on polyhedra
- The Factorization of Linear Graphs
- The greedy and Delaunay triangulations are not bad in the average case
- Tough graphs and Hamiltonian circuits.
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Traveling salesman cycles are not always subgraphs of Voronoi duals
- Voronoi diagrams and arrangements
- Voronoi diagrams from convex hulls
Cited in
(33)- Matchings in higher-order Gabriel graphs
- A short proof of the toughness of Delaunay triangulations
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- A simple method for resolving degeneracies in Delaunay triangulations
- Simpler proof of a realizability theorem on Delaunay triangulations
- Large matchings in maximal 1-planar graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- Approximate proximity drawings
- A uniqueness theorem for Delaunay graphs
- Disjoint empty disks supported by a point set
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Gibbs Delaunay tessellations with geometric hardcore conditions
- Maximum and minimum toughness of graphs of small genus
- Structural tolerance and Delaunay triangulation
- Graph-theoretical conditions for inscribability and Delaunay realizability
- On structural and graph theoretic properties of higher order Delaunay graphs
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Six topics on inscribable polytopes
- Strong matching of points with geometric shapes
- Matching points with squares
- Matchings in 1‐planar graphs with large minimum degree
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- Voronoi drawings of trees
- Affine invariant triangulations
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Triangulations without minimum-weight drawing
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Witness (Delaunay) graphs
- Matching points with rectangles and squares
- The drawability problem for minimum weight triangulations
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- 2-change for k-connected networks
- scientific article; zbMATH DE number 1629854 (Why is no real title available?)
This page was built for publication: Toughness and Delaunay triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803161)
