Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Efficient parallel solutions to some geometric problems
Journal of Parallel and Distributed Computing
Sorting in c log n parallel steps
Combinatorica
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Intersecting is easier than sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
Parallel processing for efficient subdivision search
SCG '87 Proceedings of the third annual symposium on Computational geometry
Parallel solutions to geometric problems in the scan model of computation
Journal of Computer and System Sciences
Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
IEEE Transactions on Knowledge and Data Engineering
Parallel algorithms for separable permutations
Discrete Applied Mathematics
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Information Processing Letters
Parallel algorithms for separable permutations
Discrete Applied Mathematics
Geometric algorithms for private-cache chip multiprocessors
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Robust and efficient polygon overlay on parallel stream processors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
We present techniques which result in improved parallel algorithms for a number of problems whose efficient sequential algorithms use the plane-sweeping paradigm. The problems for which we give improved algorithms include intersection detection, trapezoidal decomposition, triangulation, and planar point location. Our technique can be used to improve on the previous time bound while keeping the space and processor bounds the same, or improve on the previous space bound while keeping the time and processor bounds the same. We also give efficient parallel algorithms for visibility from a point, 3-dimensional maxima, multiple range-counting, and rectilinear segment intersection counting. We never use the AKS sorting network in any of our algorithms.