Minimal Triangulations of Polygonal Domains

1980/01/01 by G. T. Klincsek, G.T. Klincsek · 107 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Constrained Delaunay triangulation #Convex polygon #Delaunay triangulation #Domain (mathematical analysis) #Geometry #Graph Labeling and Dimension Problems #Mathematical analysis #Mathematics #Minimum-weight triangulation #Pitteway triangulation #Point set triangulation #Polygon (computer graphics) #Regular polygon #Simple polygon #Surface triangulation #Triangulation

paper · doi:10.1016/s0167-5060(08)70044-x

published in Annals of Discrete Mathematics, 121-123 (Elsevier)

crossref issued 1980/01/01 · crossref published 1980/01/01 · crossref published-print 1980/01/01 · openalex publication_date 1980/01/01 · crossref created 2008/04/26 · crossref deposited 2025/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06 · crossref indexed 2026/02/14

Citations

• Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
• On triangulations of a set of points in the plane

Cited by

• Computing a subgraph of the minimum weight triangulation
• Polynomial-time instances of the minimum weight triangulation problem
• Minimum weight pseudo-triangulations
• A lower bound for β-skeleton belonging to minimum weight triangulations☆☆This work is partially supported by NSERC grant OPG0041629.
• A New Heuristic for Minimum Weight Triangulation
• A genetic algorithm for the minimum weight triangulation
• 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
• Minimum-weight triangulation [wikipedia]