Computational geometry: an introduction
Computational geometry: an introduction
Solving problems on concurrent processors
Solving problems on concurrent processors
Heuristic approaches to task allocation for parallel computing
Heuristic approaches to task allocation for parallel computing
Vector models for data-parallel computing
Vector models for data-parallel computing
Parallel sorting by regular sampling
Journal of Parallel and Distributed Computing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Expected time bounds for selection
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Unifying Themes for Network Selection
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Many-to-many personalized communication with bounded traffic
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Parallel Contact Detection Strategies for Cable and Membrane Structures
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Word prediction using a clustered optimal binary search tree
Information Processing Letters
Thread-based implementations of the false nearest neighbors method
Parallel Computing
Word prediction using a clustered optimal binary search tree
Information Processing Letters
| Hi-index | 0.00 |
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 $n$-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.