Constrained Triangulation
Constrained Triangulation is a computational geometry method that produces a triangulation of a given polygonal domain while preserving specified edges or boundaries as part of the resulting triangulated mesh.
112
Publications
4.3K
Citations
249
Authors
120
Institutions
Publications per year
2017–2026
14
112
Constrained Delaunay triangulations
L. Paul Chew · 1987 · 260 citations
Line Assisted Light Field Triangulation and Stereo Matching
Zhan Yu, Xinqing Guo, Haibing Ling et al. · 2013 · 153 citations
1–5 of 112
249
University of California, Berkeley, United States
4 publications · 293 citations
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 249
120
University of California, Berkeley
Berkeley, United States
5 h-index
7 publications
596 citations

Delft University of Technology
Delft, The Netherlands
4 h-index
7 publications
416 citations
Wuhan University
Wuhan, China
4 h-index
17 publications
342 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
5 publications
128 citations

Idaho National Laboratory
Idaho Falls, United States
2 h-index
2 publications
86 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
2 publications
40 citations
Istituto di Matematica Applicata e Tecnologie Informatiche
Pavia, Italy
2 h-index
4 publications
320 citations

Swansea University
Swansea, United Kingdom
2 h-index
5 publications
180 citations
1–8 of 120
7 publications · 182 citations
7
h-index
4 publications · 68 citations
4
h-index
4 publications · 200 citations
4
h-index
3 publications · 63 citations
3
h-index
3 publications · 336 citations
3
h-index
1–5