论文信息 - An Optimal Parallel Algorithm For the All Nearest - - Neighbor Problem for a Convex Polygon

An Optimal Parallel Algorithm For the All Nearest - - Neighbor Problem for a Convex Polygon

In this paper we give a parallel algorithm for finding the nearest-neighbor vertex of each vertex of a convex polygon. Our algoritb..z::J. runs in O(log n) time using O(njlogn) processors, in the parallel computation model CREW PRA.lvr (ConcurrentRead, Exclusive-Write Parallel RAM). This implies that the all nearest-neighbors problem for a convex polygon can be solved in O(n/p+logn) time using p processors, which is optimal.

M. Goodrich

[1] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.

[2] D. T. Lee,et al. The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..

[3] Alain Fournier,et al. Comments on the All Nearest-Neighbor Problem for Convex Polygons , 1979, Inf. Process. Lett..

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

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

[6] Uzi Vishkin,et al. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[7] Mikhail J. Atallah,et al. Efficient Parallel Solutions to Geometric Problems , 1985, ICPP.