论文信息 - A sublogarithmic convex hull algorithm

A sublogarithmic convex hull algorithm

We present a parallel algorithm for finding the convex hull of a sorted set of points in the plane. Our algorithm runs inO(logn/log logn) time usingO(n log logn/logn) processors in theCommon crcw pram computational model, which is shown to be time and cost optimal. The algorithm is based onn1/3 divide-and-conquer and uses a simple pointer-based data structure.

Christos Levcopoulos | Jyrki Katajainen | Ola Petersson | Per-Olof Fjällström

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

[2] Richard Cole,et al. Optimal parallel algorithms for polygon and point-set problems , 1988, SCG '88.

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

[4] Richard Cole,et al. Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..

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

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

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

[8] Mikhail J. Atallah,et al. An optimal parallel algorithm for the visibility of a simple polygon from a point , 1991, JACM.

[9] Uzi Vishkin,et al. Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.

[10] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.