Iterative algorithms for the planar convex hull problem on mesh-connected arrays

Abstract Algorithms are presented which solve the planar convex hull problem on a variety of mesh-connected arrays of processors without using recursion or divide-and-conquer techniques. The algorithms for one-way iterative arrays, one-way linear cellular arrays, and two-way linear cellular arrays all operate in time O(n). The algorithm for a two-way d-dimensional cellular array operates in time O (n 1 d ) . These algorithms are optimal for their arrays. The last algorithm can be used on an O(n) processor hypercube with a time complexity of O(log2n). We also show how these algorithms can be adapted to fully dynamic implementations with optimal throughput and turn-around. We believe that these algorithms may have performance advantages over existing parallel divide-and-conquer algorithms for planar convex hull.

[1]  Manoj Kumar,et al.  An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes , 1983, IEEE Transactions on Computers.

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

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

[4]  A. M. Andrew,et al.  Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..

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

[6]  Russ Miller,et al.  Mesh Computer Algorithms for Computational Geometry , 1989, IEEE Trans. Computers.

[7]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[8]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

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

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

[11]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[12]  Mi Lu,et al.  Geometric problems on two-dimensional array processors , 1988 .

[13]  Bernard Chazelle.  Computational Geometry on a Systolic Chip , 1984, IEEE Transactions on Computers.

[14]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.

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