Conference Paper

Multi-core Implementations of Geometric Algorithms.

DOI: 10.1007/978-3-642-03456-5_18 In proceeding of: Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
Source: DBLP

ABSTRACT This paper presents a framework for multi-core implementations of divide and conquer algorithms and shows its efficiency and
ease of use by applying it to some fundamental problems in computational geometry. The framework supports automatic parallelization
of any D&C algorithm. It is only required that the algorithm is implemented by a C++ class implementing a so-called job-interface.
We also report on experimental results and discuss some aspects of the automatic parallelization of randomized incremental
algorithms. Some results of this paper have been presented in the 20th Annual Canadian Conference on Computational Geometry