Fast Randomized Parallel Methods for Planar Convex Hull Construction

Abstract We present a number of efficient parallel algorithms for constructing 2-dimensional convex hulls on a randomized CRCW PRAM. Specifically, we show how to build the convex hull of n presorted points in the plane in O(1) time using O(n log n) work, with n-exponential probability, or, alternately, in O ( log ∗ n) time using O(n) work, with n-exponential probability. We also show how to find the convex hull of n unsorted planar points in O(log n) time using O(n log h) work, with n-exponential probability, where h is the number of edges in the convex hull (h is O(n), but can be as small as O(1)). Our algorithm for unsorted inputs depends on the use of new in-place procedures, that is, procedures that are defined on a subset of elements in the input and that work without reordering the input. In order to achieve our n-exponential confidence bounds we use a new parallel technique called failure sweeping.

[1]  Bernard Chazelle,et al.  Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions , 1995, Comput. Geom..

[2]  Sandeep Sen.  Finding an Approximate Median with High Probability in Constant Parallel Time , 1990, Inf. Process. Lett..

[3]  David Eppstein,et al.  Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.

[4]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[5]  Noga Alon,et al.  Parallel linear programming in fixed dimension almost surely in constant time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  Prabhakar Ragde,et al.  The Parallel Simplicity of Compaction and Chaining , 1990, J. Algorithms.

[7]  Anita Liu Chow.  Parallel algorithms for geometric problems , 1980 .

[8]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[9]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[10]  Uzi Vishkin,et al.  Optimal parallel approximation for prefix sums and integer sorting , 1994, SODA '94.

[11]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  Danny Ziyi Chen,et al.  Efficient Geometric Algorithms on the EREW PRAM , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[15]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[16]  Michael T. Goodrich,et al.  Finding the Convex Hull of a Sorted Point Set in Parallel , 1987, Inf. Process. Lett..

[17]  Uzi Vishkin,et al.  A fast parallel algorithm for finding the convex hull of a sorted point set , 1996, Int. J. Comput. Geom. Appl..

[18]  Uzi Vishkin,et al.  Converting high probability into nearly-constant time—with applications to parallel hashing , 1991, STOC '91.

[19]  Xiaotie Deng.  An Optimal Parallel Algorithm for Linear Programming in the Plane , 1990, Inf. Process. Lett..

[20]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[21]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[22]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  Russ Miller,et al.  Efficient Parallel Convex Hull Algorithms , 1988, IEEE Trans. Computers.

[24]  Torben Hagerup,et al.  Optimal Merging and Sorting on the Erew Pram , 1989, Inf. Process. Lett..

[25]  Michael T. Goodrich.  Constructing the Convex Hull of a Partially Sorted Set of Points , 1992, Comput. Geom..

[26]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[27]  Michael T. Goodrich,et al.  In-place techniques for parallel convex hull algorithms (preliminary version) , 1991, SPAA '91.

[28]  Andrew Chi-Chih Yao,et al.  A Lower Bound to Finding Convex Hulls , 1981, JACM.