Toughness and Delaunay triangulations
- 1 December 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (6) , 575-601
- https://doi.org/10.1007/bf02187810
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- On sorting triangles in a delaunay tessellationAlgorithmica, 1991
- Realizability of delaunay triangulationsInformation Processing Letters, 1990
- Some problems in computational geometryAlgorithmica, 1987
- Connect-the-dots: A new heuristicComputer Vision, Graphics, and Image Processing, 1987
- Some problems on polyhedraJournal of Geometry, 1987
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947
- A Theorem on GraphsAnnals of Mathematics, 1931