Optimal Polygon Triangulation
Optimal Polygon Triangulation is a computational geometry method that belongs to the class of polygon triangulation techniques, distinguished by its objective of decomposing a polygon into triangles such that a specified optimality criterion—such as minimal total edge weight or minimal maximum angle—is achieved.
9
Publications
306
Citations
14
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
9
Piecewise-linear interpolation between polygonal slices
Gill Barequet, Micha Sharir · 1994 · 40 citations · Full text
1–5 of 9
14
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 14
8

Hiroshima University
Hiroshima, Japan
2 h-index
3 publications
48 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
2 publications
177 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
3 publications
217 citations
New York University
New York, United States
2 h-index
2 publications
177 citations
University of Houston
Houston, United States
2 h-index
6 publications
144 citations

North Carolina Central University
Durham, United States
1 h-index
1 publications
23 citations
Max Planck Society
Munich, Germany
1 h-index
1 publications
16 citations

University of Saskatchewan
Saskatoon, Canada
1 h-index
1 publications
23 citations
1–8 of 8
TPDS · 1 publications · 36 citations
1
h-index
CVIU · 1 publications · 137 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 23 citations
1
h-index
1–5