Triangulation Graphs
Triangulation Graphs is a graph-theoretic construct that represents the decomposition of a polygon into triangles by non-crossing diagonals, where vertices correspond to polygon vertices and edges include both polygon sides and added diagonals that partition the polygonal region into triangular faces.
87
Publications
3K
Citations
177
Authors
123
Institutions
Publications per year
2017–2026
4
Parents
87
Triangulation and shape-complexity
Bernard Chazelle, Janet Incerpi · ACM Transactions on Graphics · 1984 · 126 citations · Full text
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Anne Berry, Jean R. S. Blair, Pinar Heggernes et al. · Algorithmica · 2004 · 114 citations
1–5 of 87
177
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 177
123

Vanderbilt University
Nashville, United States
4 h-index
5 publications
112 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
5 publications
104 citations

Slovak University of Technology in Bratislava
Bratislava, Slovakia
3 h-index
4 publications
118 citations

The Open University
Milton Keynes, United Kingdom
3 h-index
6 publications
210 citations
Technical University of Denmark
Kongens Lyngby, Denmark
3 h-index
4 publications
179 citations

University of British Columbia
Vancouver, Canada
2 h-index
3 publications
69 citations

Yokohama National University
Yokohama, Japan
2 h-index
2 publications
73 citations

Universidad Politécnica de Madrid
Madrid, Spain
2 h-index
4 publications
124 citations
1–8 of 123
7 publications · 249 citations
7
h-index
6 publications · 182 citations
6
h-index
5 publications · 377 citations
5
h-index
4 publications · 117 citations
4
h-index
4 publications · 146 citations
4
h-index
1–5