Efficient plane sweeping in parallel
SCG '86 Proceedings of the second annual symposium on Computational geometry
The input/output complexity of sorting and related problems
Communications of the ACM
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Intersecting line segments in parallel with an output-sensitive number of processors
SIAM Journal on Computing
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Cache Oblivious Distribution Sweeping
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Efficient Parallel Algorithms for Geometric Partitioning Problems through Parallel Range Searching
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 03
Provably good multicore cache performance for divide-and-conquer algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Cache-efficient dynamic programming algorithms for multicores
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Cache-Oblivious Red-Blue Line Segment Intersection
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Parallel external memory model - a parallel model for multi-core architectures
Parallel external memory model - a parallel model for multi-core architectures
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Paging for multi-core shared caches
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Computational geometry in the parallel external memory model
SIGSPATIAL Special
| Hi-index | 0.00 |
We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors. We show how to obtain optimal algorithms for interval stabbing counting, 1-D range counting, weighted 2-D dominance counting, and for computing 3-D maxima, 2-D lower envelopes, and 2-D convex hulls. These results are obtained by analyzing adaptations of either the PEM merge sort algorithm or PRAM algorithms. For the second group of problems--orthogonal line segment intersection reporting, batched range reporting, and related problems--more effort is required. What distinguishes these problems from the ones in the previous group is the variable output size, which requires I/O-efficient load balancing strategies based on the contribution of the individual input elements to the output size. To obtain nearly optimal algorithms for these problems, we introduce a parallel distribution sweeping technique inspired by its sequential counterpart.