Minimum-weight Triangulation
Minimum-Weight Triangulation is a polygon triangulation that belongs to the class of geometric triangulations and is distinguished by minimizing the sum of the Euclidean lengths of its edges over all possible triangulations of a given point set or polygon.
38
Publications
1.2K
Citations
55
Authors
39
Institutions
Publications per year
2017–2026
0
38
Minimum-weight triangulation is NP-hard
Wolfgang Mulzer, Günter Rote · Journal of the ACM · 2008 · 180 citations · Full text
On triangulations of a set of points in the plane
Errol L. Lloyd · 1977 · 116 citations · Full text
Computing a subgraph of the minimum weight triangulation
Julian Keil · Computational Geometry · 1994 · 63 citations
New Results on Planar Triangulations.
Peter D Gilbert · Defense Technical Information Center (DTIC) · 1979 · 50 citations
1–5 of 38
55
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 55
39

Middlebury College
Middlebury (village), United States
3 h-index
6 publications
150 citations

Carleton University
Ottawa, Canada
3 h-index
4 publications
127 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
3 h-index
4 publications
92 citations

Lund University
Lund, Sweden
3 h-index
5 publications
107 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
3 publications
94 citations
Dartmouth College
Hanover, United States
2 h-index
2 publications
53 citations

Xi'an Jiaotong University
Xi'an, China
2 h-index
2 publications
47 citations

University of Saskatchewan
Saskatoon, Canada
2 h-index
2 publications
85 citations
1–8 of 39
4 publications · 55 citations
4
h-index
IJCGA · 3 publications · 75 citations
3
h-index
3 publications · 85 citations
3
h-index
3 publications · 108 citations
3
h-index
2 publications · 29 citations
2
h-index
1–5