Computing a subgraph of the minimum weight triangulation
- 31 May 1994
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 4 (1) , 18-26
- https://doi.org/10.1016/0925-7721(94)90014-0
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A quadratic time algorithm for the minmax length triangulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The γ-neighborhood graphComputational Geometry, 1992
- A New Heuristic for Minimum Weight TriangulationSIAM Journal on Algebraic Discrete Methods, 1987
- A heuristic triangulation algorithmJournal of Algorithms, 1987
- An ω(√n) lower bound for the nonoptimality of the greedy triangulationInformation Processing Letters, 1987
- A Framework for Computational MorphologyPublished by Elsevier ,1985
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Minimal Triangulations of Polygonal DomainsPublished by Elsevier ,1980
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979