The drawability problem for minimum weight triangulations

2002/01/01 by William Lenhart, Giuseppe Liotta · 7 citations
Computer Science · Mathematics · #Bowyer–Watson algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Computer science #Constrained Delaunay triangulation #Data Management and Algorithms #Delaunay triangulation #Discrete mathematics #Geometry #Graph #Mathematics #Minimum weight #Minimum-weight triangulation #Pitteway triangulation #Point set triangulation #Set (abstract data type) #Triangulation

paper · pdf · doi:10.1016/s0304-3975(00)00383-2

published in Theoretical Computer Science 270(1-2), 261-286 (Elsevier BV)

crossref issued 2002/01/01 · crossref published 2002/01/01 · crossref published-print 2002/01/01 · openalex publication_date 2002/01/01 · crossref created 2002/07/25 · crossref deposited 2020/01/08 · crossref indexed 2022/03/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Citations

• Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
• Computing a subgraph of the minimum weight triangulation
• A note on Delaunay and optimal triangulations
• Computing the minimum weight triangulation of a set of linearly ordered points
• Relative neighborhood graphs and their relatives
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

Cited by

• An Ant Colony Algorithm for the Minimum Weight Triangulation
• Minimum-weight triangulation [wikipedia]