Triangulation Data Structures
Triangulation Data Structures is a spatial data structure that organizes geometric points into a simplicial complex of triangles, distinguished by its explicit encoding of topological relationships among vertices, edges, and faces to support efficient spatial queries and geometric computations.
73
Publications
4.4K
Citations
140
Authors
75
Institutions
Publications per year
2017–2026
5
Parents
73
Triangulating a simple polygon in linear time
Bernard Chazelle · Discrete & Computational Geometry · 1991 · 636 citations · Full text
Triangulations: structures for algorithms and applications
Choice Reviews Online · 2011 · 335 citations
Minimal triangulations of graphs: A survey
Pinar Heggernes · Discrete Mathematics · 2006 · 181 citations
1–5 of 73
140
3
h-index
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 98 citations
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 140
75
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
12 publications
641 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
6 publications
151 citations
University of California, Irvine
Irvine, United States
3 h-index
7 publications
202 citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
3 h-index
4 publications
188 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
364 citations
ETH Zurich
Zurich, Switzerland
3 h-index
6 publications
219 citations
Princeton University
Princeton, United States
3 h-index
3 publications
764 citations
Université Libre de Bruxelles
Brussels, Belgium
2 h-index
2 publications
25 citations
1–8 of 75
4 publications · 195 citations
4
h-index
4 publications · 60 citations
4
h-index
3 publications · 343 citations
3
h-index
TVCG · 2 publications · 235 citations
2
h-index
2 publications · 137 citations
2
h-index
1–5