Triangulation Enumeration
Triangulation Enumeration is the systematic computational process of generating and cataloging all distinct triangulations of a given polygon, distinguished from related enumeration methods by its focus on exhaustively listing every non-isomorphic decomposition into triangles via non-intersecting diagonals.
49
Publications
1.6K
Citations
81
Authors
58
Institutions
Publications per year
2017–2026
3
Parents
49
Triangulations: structures for algorithms and applications
Choice Reviews Online · 2011 · 335 citations
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 49
81
4
h-index
3
h-index
3
h-index
2
h-index
University of North Carolina at Chapel Hill, United States
2 publications · 34 citations
2
h-index
1–5 of 81
58
Technische Universität Berlin
Berlin, Germany
5 h-index
9 publications
211 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
6 publications
235 citations

Cornell University
Ithaca, United States
3 h-index
6 publications
124 citations
ETH Zurich
Zurich, Switzerland
3 h-index
5 publications
81 citations

University of Minnesota
Minneapolis, United States
3 h-index
4 publications
118 citations

Saarland University
Saarbrücken, Germany
3 h-index
5 publications
89 citations

Universidad de Cantabria
Santander, Spain
2 h-index
2 publications
63 citations
University of California, Davis
Davis, United States
2 h-index
2 publications
33 citations
1–8 of 58
4 publications · 149 citations
4
h-index
3 publications · 72 citations
3
h-index
3 publications · 126 citations
3
h-index
Repository · 3 publications · 53 citations
3
h-index
2 publications · 72 citations
2
h-index
1–5