Parallel Delaunay triangulation for part
β
Fragakis, Yannis ;OΓ±ate, Eugenio
π
Article
π
2007
π
John Wiley and Sons
π
English
β 259 KB
## Abstract Delaunay triangulation is a geometric problem that is relatively difficult to parallelize. Parallel algorithms are usually characterized by considerable interprocessor communication or important serialized parts. In this paper, we propose a method that achieves high speedβups, but needs