Triangulation Algorithms
Triangulation Algorithms is a computational method in the field of geographic information science that systematically partitions a set of irregularly distributed points into a contiguous network of non-overlapping triangles to optimize surface representation and geometric accuracy.
1.2K
Publications
70.1K
Citations
2.1K
Authors
769
Institutions
Publications per year
2017–2026
101
1.2K
Zippered polygon meshes from range images
Greg Turk, Marc Levoy · 1994 · 1.3K citations
Computing Dirichlet tessellations
Adrian Bowyer · The Computer Journal · 1981 · 1.1K citations · Full text
1–5 of 1.2K
2.1K
University of Illinois Urbana-Champaign, United States
15 publications · 3K citations
15
h-index
Institut national de recherche en sciences et technologies du numérique, France
20 publications · 958 citations
15
h-index
14
h-index
University of North Carolina at Chapel Hill, United States
17 publications · 731 citations
13
h-index
11
h-index
1–5 of 2.1K
769
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
29 h-index
98 publications
4.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
22 h-index
39 publications
2.4K citations
Princeton University
Princeton, United States
20 h-index
31 publications
3.9K citations

Tel Aviv University
Tel Aviv, Israel
17 h-index
31 publications
1.5K citations

Carleton University
Ottawa, Canada
16 h-index
27 publications
961 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
16 h-index
28 publications
1K citations
University of California, Berkeley
Berkeley, United States
15 h-index
26 publications
4K citations
University of California, Irvine
Irvine, United States
14 h-index
17 publications
696 citations
1–8 of 769
49 publications · 2.1K citations
26
h-index
TOG · 30 publications · 2.4K citations
23
h-index
30 publications · 2.3K citations
22
h-index
22 publications · 1.2K citations
19
h-index
IJCGA · 23 publications · 793 citations
17
h-index
1–5