Computing a subgraph of the minimum weight triangulation

1994/05/01 by Julian Keil, J.Mark Keil · 32 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Digital Image Processing Techniques #Geometry #Mathematics #Triangulation

paper · doi:10.1016/0925-7721(94)90014-0

published in Computational Geometry 4(1), 18-26 (Elsevier BV)

crossref issued 1994/05/01 · crossref published 1994/05/01 · crossref published-print 1994/05/01 · openalex publication_date 1994/05/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06 · crossref indexed 2026/05/09

Citations

• Minimal Triangulations of Polygonal Domains
• Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
• An ω(√n) lower bound for the nonoptimality of the greedy triangulation
• A heuristic triangulation algorithm
• A note on Delaunay and optimal triangulations
• A quadratic time algorithm for the minmax length triangulation

Cited by

• On β-skeleton as a subgraph of the minimum weight triangulation
• New results on MWT subgraphs
• A lower bound for β-skeleton belonging to minimum weight triangulations☆☆This work is partially supported by NSERC grant OPG0041629.
• The drawability problem for minimum weight triangulations
• An Ant Colony Algorithm for the Minimum Weight Triangulation
• Implementations of the LMT heuristic for minimum weight triangulation
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• A (usually?) connected subgraph of the minimum weight triangulation
• Beta skeleton [wikipedia]
• Minimum-weight triangulation [wikipedia]