Toughness and Delaunay triangulations
From MaRDI portal
Publication:803161
DOI10.1007/BF02187810zbMATH Open0727.05040OpenAlexW2118927049MaRDI QIDQ803161FDOQ803161
Authors: Michael B. Dillencourt 
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131137
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
- Title not available (Why is that?)
- The Factorization of Linear Graphs
- Voronoi diagrams and arrangements
- Graph theory with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Voronoi diagrams from convex hulls
- Title not available (Why is that?)
- Delaunay graphs are almost as good as complete graphs
- Realizability of Delaunay triangulations
- Title not available (Why is that?)
- A theorem on graphs
- Tough graphs and Hamiltonian circuits.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizing tough graphs is NP-hard
- Title not available (Why is that?)
- A note on Delaunay and optimal triangulations
- On the average length of Delaunay triangulations
- Generalized Dirichlet tesselations
- Title not available (Why is that?)
- A 1-tough nonhamiltonian maximal planar graph
- The greedy and Delaunay triangulations are not bad in the average case
- On sorting triangles in a Delaunay tessellation
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- Traveling salesman cycles are not always subgraphs of Voronoi duals
- Recognizing Dirichlet tesselations
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Some problems in computational geometry
- A non-Hamiltonian, nondegenerate Delaunay triangulation
- An upper bound on the shortness exponent of inscribable polytopes
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
- Some problems on polyhedra
- Title not available (Why is that?)
- Connect-the-dots: A new heuristic
- Title not available (Why is that?)
- Hamiltonian circuits on 3-polytopes
Cited In (33)
- Matching points with squares
- Matchings in higher-order Gabriel graphs
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- On structural and graph theoretic properties of higher order Delaunay graphs
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- Triangulations without minimum-weight drawing
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Six topics on inscribable polytopes
- A simple method for resolving degeneracies in Delaunay triangulations
- Title not available (Why is that?)
- Simpler proof of a realizability theorem on Delaunay triangulations
- Voronoi drawings of trees
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- 2-change for k-connected networks
- Large matchings in maximal 1-planar graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- Gibbs Delaunay tessellations with geometric hardcore conditions
- Approximate proximity drawings
- Affine invariant triangulations
- A uniqueness theorem for Delaunay graphs
- Structural tolerance and Delaunay triangulation
- Witness (Delaunay) graphs
- A short proof of the toughness of Delaunay triangulations
- Maximum and minimum toughness of graphs of small genus
- The drawability problem for minimum weight triangulations
- Strong matching of points with geometric shapes
- Disjoint empty disks supported by a point set
- Matchings in 1‐planar graphs with large minimum degree
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Matching points with rectangles and squares
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
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)
