Efficient Delaunay Tessellation through K-D Tree Decomposition

Abstract

Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.

Grid-based minimization at scale: Feldman-Cousins corrections for light sterile neutrino search

“…Finally, we utilize DIY [11] for data parallelism across processes and nodes, and Eigen3 for linear algebra and vectorized calculations. The application is parameterized as a function of the number of universes N univ , the number of grid points N gridpoint , and the standard MPI option for number of ranks.…”

Failure-Atomic Byte-Addressable R-tree for Persistent Memory

“…Typically, the content of scientific data files are a collection of multidimensional arrays along with the associated spatio-temporal coordinates [35][36][37]40]. To help navigating through large scientific datasets, various multidimensional indexing techniques, such as R-trees [41,42], have been developed and used widely to allow for direct access to particular datasets [28,29,[43][44][45][46]. For example, multiphysics oil reservoir simulation [47], spatial modeling of the brain [39], and disease transmission analysis [40] employ multidimensional indexes to accelerate range query processing performance.…”