Finding the convex hull of a sorted point set in parallel

Information Processing Letters

Volumn 26, Issue 4, 1987, Pages 173-179

  Goodrich, Michael T ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

computational geometry; convex hull problem.; divide and conquer; Parallel algorithms

Indexed keywords

EID: 0345496339     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(87)90002-0     Document Type: Article

References (20)

1. Parallel computational geometry
2. Efficient parallel solutions to some geometric problems
3. Parallel algorithms for some functions of two convex polygons
4. Geometric Transformations for Fast Geometric Algorithms
5. Computational Geometry on a Systolic Chip
6. Parallel Algorithms for Geometric Problems
7. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms
8. A parallel algorithm for triangulating simplical point sets in space with optimal speed-up
9. Efficient Parallel Techniques for Computational Geometry
10. An efficient algorithm for determining the convex hull of a finite planar set
11. The ultimate planar convex hull algorithm?
12. The power of parallel prefix
13. Parallel Prefix Computation
14. Computational Geometry—A Survey
15. Computational geometry on a mesh-connected computer
16. Maintenance of configurations in the plane
17. An optimal real-time algorithm for planar convex hulls
18. Convex hulls of finite sets of points in two and three-dimensions
19. Finding the intersection of n half-spaces in time O(n log n)
20. A lower bound to finding convex hulls