Voronoi diagrams and arrangements
Discrete & Computational Geometry
An introduction to parallel algorithms
An introduction to parallel algorithms
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Parallel computational geometry
Parallel computational geometry
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Parallel divide-and-conquer scheme for 2D Delaunay triangulation: Research Articles
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
The paper describes a parallel algorithm for computing an n-dimensional Delaunay tessellation using a divide-conquer strategy. Its implementation (using MPI library for C) in the case n驴=驴2, relied on restricted areas to discard non-Delaunay edges, is executed easily on PC clusters. We shows that the convexity is a crucial factor of efficiency of the parallel implementation over the corresponding sequential one.