1. What have the authors contributed in "Parallel geometric algorithms for multi-core computers" ?
In this paper, the authors present several parallel geometric algorithms that specifically target this environment, with the goal of exploiting the additional computing power.. The d-dimensional algorithms the authors 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.. The authors show experimental results for these algorithms in 3D, using their implementations based on the Computational Geometry Algorithms Library ( CGAL, http: //www. cgal. org/ ).. This work is a step towards what the authors hope will become a parallel mode for CGAL, where algorithms automatically use the available parallel resources without requiring significant user intervention.
read more
2. What future works have the authors mentioned in the paper "Parallel geometric algorithms for multi-core computers" ?
In the future, the authors plan to extend their implementation to cover more algorithms, and then submit it for integration in CGAL once it is stable enough, to serve as a first stone towards a parallel mode which CGAL users will be able to benefit from transparently.
read more
3. What is the name of the journal?
Key-words: parallel algorithms, geometric algorithms, Delaunay triangulations, Delaunay meshes, d-dimension, kd trees, box intersection, spatial sort, compact container, CGAL, multi-core∗ Universidade Federal do Rio de Janeiro/COPPE, Brazil.
read more
4. What is the purpose of the HAL?
The d-dimensional algorithms the authors 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.
read more
