Issue No. 02 - February (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.841750
<p><b>Abstract</b>—Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of spatial data. The data structure is useful in several applications including graph partitioning, hierarchical applications such as molecular dynamics and <tmath>$n$</tmath>-body simulations, and databases. In this paper, we study efficient parallel construction of k-d trees on coarse-grained distributed memory parallel computers. We consider several algorithms for parallel k-d tree construction and analyze them theoretically and experimentally, with a view towards identifying the algorithms that are practically efficient. We have carried out detailed implementations of all the algorithms discussed on the CM-5 and report on experimental results.</p>
k-d trees, hypercubes, meshes, multidimensional binary search trees, parallel algorithms, parallel computers.
Ibraheem Al-furaih, Sanjay Ranka, Srinivas Aluru, Sanjay Goil, "Parallel Construction of Multidimensional Binary Search Trees", IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 136-148, February 2000, doi:10.1109/71.841750