Convex Polygon Triangulation
Convex Polygon Triangulation is the decomposition of a convex polygon into a set of non-overlapping triangles by drawing non-intersecting diagonals between its vertices, such that the triangulation covers the entire polygonal area and exploits the polygon’s convexity to ensure that any internal diagonal lies entirely within the polygon.
42
Publications
1.7K
Citations
77
Authors
47
Institutions
Publications per year
2017–2026
1
Parents
42
Triangulating a simple polygon
M. R. Garey, David S. Johnson, Franco P. Preparata et al. · Information Processing Letters · 1978 · 299 citations
1–5 of 42
77
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 77
47
University of California, Irvine
Irvine, United States
3 h-index
3 publications
64 citations

Cornell University
Ithaca, United States
3 h-index
6 publications
190 citations
Palo Alto Research Center
Palo Alto, United States
2 h-index
4 publications
80 citations
Utrecht University
Utrecht, The Netherlands
2 h-index
3 publications
60 citations
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
146 citations

Middlebury College
Middlebury (village), United States
2 h-index
2 publications
44 citations

McGill University
Montreal, Canada
2 h-index
4 publications
246 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
44 citations
1–8 of 47
4 publications · 154 citations
4
h-index
2 publications · 319 citations
2
h-index
1 publications · 42 citations
2
h-index
2 publications · 27 citations
2
h-index
2 publications · 94 citations
2
h-index
1–5