SIAM Journal on Computing
A bridging model for parallel computation
Communications of the ACM
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Parallel computational geometry
Parallel computational geometry
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multidimensional divide-and-conquer
Communications of the ACM
d-Dimensional Range Search on Multicomputers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Efficient routing and message bounds for optimal parallel algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Direct Bulk-Synchronous Parallel Algorithms
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A Convex Hull Algorithm on Coarse-Grained Multiprocessors
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
| Hi-index | 0.00 |
This paper presents a parallel algorithm for solving grounded range search in associative-function mode using the BSP-like Coarse Grained Multicomputer (CGM). Given a set S of n weighted points in the plane, the algorithm requires O(1) communication rounds (h-relations with h = O(n/p)), O((n/p) log n) local computation, and O(n/p) memory per processor (n/p 驴 p), to solve m = O(n) grounded range search problems. The result implies new or improved solutions to a number of other geometric applications including d-dimensional range search, quadrant search, interval intersection, and chromatic range queries.