Delaunay Refinement is a mesh generation algorithm that iteratively improves the quality of a Delaunay triangulation by inserting additional vertices to eliminate poorly shaped elements, particularly sliver triangles, while preserving the Delaunay property.
116
Publications
8.6K
Citations
176
Authors
99
Institutions
Publications per year
2017–2026
11
Parents
Publications
116
Optimistic parallelism requires abstractions
Milind Kulkarni, Keshav Pingali, Bruce Walter et al. · 2007 · 447 citations
Tetrahedral mesh generation by Delaunay refinement
Jonathan Richard Shewchuk · 1998 · 372 citations
1–5 of 116
Authors
176
- NC
11
h-index
- TK
9
h-index
- AN
8
h-index
- GL
6
h-index
- JRJonathan Richard Shewchuk
University of California, Berkeley, United States
6 publications · 1.8K citations
6
h-index
1–5 of 176
Institutions
99
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
12 h-index
28 publications
1.2K citations
Carnegie Mellon University
Pittsburgh, United States
11 h-index
19 publications
1.1K citations
The Ohio State University
Columbus, United States
8 h-index
13 publications
343 citations
William & Mary
Williamsburg, United States
6 h-index
9 publications
334 citations
University of California, Berkeley
Berkeley, United States
6 h-index
7 publications
1.5K citations
Cornell University
Ithaca, United States
6 h-index
17 publications
2.5K citations
Williams (United States)
Tulsa, United States
6 h-index
9 publications
334 citations
Geometric (India)
Mumbai, India
5 h-index
12 publications
689 citations
1–8 of 99
Venues
- International Journal for Numerical Methods in Engineering
8 publications · 574 citations
8
h-index
- IEEE Transactions on Magnetics
7 publications · 111 citations
7
h-index
- SIAM Journal on Scientific Computing
6 publications · 161 citations
6
h-index
- Computational Geometry
5 publications · 1.3K citations
5
h-index
- Engineering With Computers
4 publications · 103 citations
4
h-index
1–5