Parallel Delaunay Triangulation
Parallel Delaunay Triangulation is a computational method for constructing Delaunay triangulations by simultaneously processing spatial data across multiple processing units, distinguished by its use of parallel algorithms to divide and conquer triangulation tasks for improved efficiency and scalability.
41
Publications
1.3K
Citations
92
Authors
62
Institutions
Publications per year
2017–2026
8
41
Design and Implementation of a Practical Parallel Delaunay Algorithm
Guy E. Blelloch, Gary L. Miller, Jonathan C. Hardwick et al. · Algorithmica · 1999 · 103 citations
Distributed parallel Delaunay mesh generation
Rajab Said, Nigel Weatherill, K. Morgan et al. · Computer Methods in Applied Mechanics and Engineering · 1999 · 68 citations
Parallel 3D Delaunay Triangulation
Paolo Cignoni, C. Montani, Raffaele Perego et al. · Computer Graphics Forum · 1993 · 67 citations
1–5 of 41
92
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 92
62
Carnegie Mellon University
Pittsburgh, United States
5 h-index
12 publications
488 citations
William & Mary
Williamsburg, United States
4 h-index
6 publications
214 citations
University of West Bohemia in Pilsen
Pilsen, Czechia
3 h-index
6 publications
140 citations
Williams (United States)
Tulsa, United States
3 h-index
5 publications
113 citations
Pittsburgh Supercomputing Center
Pittsburgh, United States
3 h-index
3 publications
175 citations

Beijing University of Civil Engineering and Architecture
Beijing, China
2 h-index
7 publications
116 citations
Consorzio Pisa Ricerche
Pisa, Italy
2 h-index
9 publications
388 citations
Pohang University of Science and Technology
Pohang, South Korea
2 h-index
4 publications
70 citations
1–8 of 62
3 publications · 149 citations
3
h-index
2 publications · 34 citations
2
h-index
2 publications · 33 citations
2
h-index
2 publications · 143 citations
2
h-index
2 publications · 101 citations
2
h-index
1–5