Parallel geometric algorithms for multi-core computers

Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this environment, with the goal of exploiting the additional computing power. The d-dimensional algorithms we describe are (a) spatial sorting of points, as is typically used for preprocessing before using incremental algorithms, (b) kd-tree construction, (c) axis-aligned box intersection computation, and finally (d) bulk insertion of points in Delaunay triangulations for mesh generation algorithms or simply computing Delaunay triangulations. We show experimental results for these algorithms in 3D, using our implementations based on the Computational Geometry Algorithms Library (CGAL1 ). This work is a step towards what we hope will become a parallel mode for CGAL, where algorithms automatically use the available parallel resources without requiring significant user intervention. Categories and Subject Descriptors I...

• Type: Conference
• Year: 2009
• Where: COMPGEOM
• Authors: Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler
• Keywords: Algorithms, COMPGEOM 2009, Computational Geometry Algorithms Library, Discrete Geometry, Parallel Geometric Algorithms