Efficient parallel solutions to some geometric problems

Journal of Parallel and Distributed Computing

Volumn 3, Issue 4, 1986, Pages 492-507

  Atallah, Mikhail J ^a   Goodrich, Michael T ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249040380     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(86)90011-0     Document Type: Article

References (24)

1. Parallel computational geometry
2. Sorting in c log n parallel steps
3. Multidimensional divide-and-conquer
4. Divide-and-conquer in multidimensional space
5. Routing, merging, and sorting on parallel models of computation
6. Geometric transformations for fast geometric algorithms
7. Computational geometry on a systolic chip
8. Parallel algorithms for geometric problems
9. An optimal parallel algorithm for the all nearest-neighbor problem for a convex polygon
10. An efficient algorithm for determining the convex hull of a finite planar set
11. Parallel prefix computation
12. Computational geometry—A survey
13. Tight bounds on the complexity of parallel sorting
14. Maintenance of configurations in the plane
15. An optimal real-time algorithm for planar convex hulls
16. Convex hulls of finite sets of points in two and three dimensions.
17. Finding the intersection of n half-spaces in time O(n log n)
18. Closest-point problems
19. Parallelism in comparison problems
20. A lower bound to finding convex hulls