Parallel computation of optimal enclosing balls by iterative orthant scan

• A fast minimum enclosing ball algorithm for general dimensions.
• An effective heuristic drastically reducing the number of algorithmic steps.
• Exhaustive study of parallelization opportunities for different platforms.
• Real-time exact bounding sphere computation in 3D.

We propose an algorithm for computing the exact minimum enclosing ball of large point sets in general dimensions. It aims to reduce the number of passes by retrieving a well-balanced set of outliers in each linear search through the input by decomposing the space into orthants. The experimental evidence indicates that the convergence rate in terms of the required number of linear passes is superior compared to previous exact methods, and substantially faster execution times are observed in dimensions d≤16d≤16. In the important three-dimensional case, the execution times indicate real-time performance. Furthermore, we show how the algorithm can be adapted for parallel execution on both CPU and GPU architectures using OpenMP, AVX, and CUDA. For large datasets, our CUDA solution is superior. For example, the benchmark results show that optimal bounding spheres for inputs with tens of millions of points can be computed in just a few milliseconds.

Figure optionsDownload high-quality image (184 K)Download as PowerPoint slide