Incremental Triangulation
Incremental Triangulation is a computational method in polygon triangulation that iteratively constructs a triangulated decomposition by successively inserting vertices or edges and updating the existing structure in a localized manner.
42
Publications
2.4K
Citations
73
Authors
36
Institutions
Publications per year
2017–2026
2
Parents
42
A comparison of sequential Delaunay triangulation algorithms
Peter Su, Robert L. Scot Drysdale · 1995 · 133 citations · Full text
1–5 of 42
73
University of Illinois Urbana-Champaign, United States
5 publications · 605 citations
5
h-index
Egypt-Japan University of Science and Technology, Egypt
3 publications · 128 citations
3
h-index
3
h-index
3
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 82 citations
2
h-index
1–5 of 73
36
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
11 publications
1.3K citations
University of Maryland, College Park
College Park, United States
2 h-index
3 publications
155 citations
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
267 citations

University of Maribor
Maribor, Slovenia
2 h-index
3 publications
64 citations

University of Tübingen
Tübingen, Germany
2 h-index
4 publications
48 citations
Los Alamos National Laboratory
Los Alamos, United States
2 h-index
4 publications
326 citations
Dartmouth College
Hanover, United States
2 h-index
2 publications
254 citations

University of Amsterdam
Amsterdam, The Netherlands
2 h-index
4 publications
142 citations
1–8 of 36
3 publications · 367 citations
3
h-index
2 publications · 349 citations
2
h-index
2 publications · 47 citations
2
h-index
2 publications · 221 citations
2
h-index
1 publications · 79 citations
1
h-index
1–5