Parallel algorithms for geometric problems
- Author:
- Anita Liu Chow
Abstract
No abstract available.
Cited By
Lo S, Lee C, Chung I and Chung Y (2013). Optimizing Pairwise Box Intersection Checking on GPUs for Large-Scale Simulations, ACM Transactions on Modeling and Computer Simulation (TOMACS), 23:3, (1-22), Online publication date: 1-Jul-2013.- ElGindy H and Wetherall L (1997). A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh, IEEE Transactions on Parallel and Distributed Systems, 8:11, (1133-1142), Online publication date: 1-Nov-1997.
- Zhou J, Deng X and Dymond P A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases Proceedings of the 11th International Symposium on Parallel Processing, (596-602)
- Gupta N and Sen S Faster output-sensitive parallel convex hulls for d≤3 Proceedings of the twelfth annual symposium on Computational geometry, (176-185)
- Dehne F, Deng X, Dymond P, Fabri A and Khokhar A A randomized parallel 3D convex hull algorithm for coarse grained multicomputers Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, (27-33)
- Rajasekaran S and Ramaswami S Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems Proceedings of the tenth annual symposium on Computational geometry, (57-66)
- Amato N and Preparata F An NC parallel 3D convex hull algorithm Proceedings of the ninth annual symposium on Computational geometry, (289-297)
- Goodrich M Constructing arrangements optimally in parallel (preliminary version) Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, (169-179)
- Ghouse M and Goodrich M In-place techniques for parallel convex hull algorithms (preliminary version) Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, (192-203)
- Saxena S, Bhatt P and Prasad V (2019). Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions, IEEE Transactions on Computers, 39:3, (400-404), Online publication date: 1-Mar-1990.
- Goodrich M, Ghouse M and Bright J Generalized sweep methods for parallel computational geometry Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (280-289)
- Atallah M, Callahan P and Goodrich M P-complete geometric problems Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (317-326)
- Reif J and Sen S Randomized algorithms for binary search and load balancing with geometric applications Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (327-339)
- Goodrich M Intersecting line segments in parallel with an output-sensitive number of processors Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, (127-137)
- Reif J and Sen S Polling: a new randomized sampling technique for computational geometry Proceedings of the twenty-first annual ACM symposium on Theory of computing, (394-404)
- Cole R and Goodrich M Optimal parallel algorithms for polygon and point-set problems Proceedings of the fourth annual symposium on Computational geometry, (201-210)
- Jeong C and Lee T Parallel geometric algorithms on mesh-connected computers Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, (311-318)
- Atallah M and Goodrich M Efficient plane sweeping in parallel Proceedings of the second annual symposium on Computational geometry, (216-225)
Recommendations
Parallel algorithms for geometric problems on networks of processors
SPDP '93: Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed ProcessingIn this paper, we present algorithms for solving several basic geometric problems of size n in a network of p processors each with O(n/p) local memory. Our algorithms achieve the best possible (up to a constant factor) time bound in hypercubic parallel ...
On the parallel decomposability of geometric problems
SCG '89: Proceedings of the fifth annual symposium on Computational geometryThere is a large and growing body of literature concerning the solution of geometric problems on mesh-connected arrays of processors [5,9,14,17]. Most of these algorithms are optimal (i.e., run in time Ο(n1/d) on a d-dimensional n-processor array), and ...