Time-optimal proximity algorithms on meshes with multiple broadcasting

The all-nearest neighbor problem (ANN) is stated as follows: given a set of points in the plane, determine for every point in S, a point that lies closest to it. The ANN problem is central to VLSI design, computer graphics, pattern recognition, and image processing, among others. We propose two time-optimal algorithms to solve the ANN problem for an arbitrary set of points in the plane and also for the special case in which the points are vertices of a convex polygon. Both algorithms run on meshes with multiple broadcasting. We first establish an /spl Omega/(log n) time lower bound for the task of solving an arbitrary n-point instance of the ANN problem, even if the points are the vertices of a convex polygon. This lower bound holds for both the CREW-PRAM and for the mesh with multiple broadcasting. Next, we show that the bound is tight by exhibiting algorithms solving the problem in O(log n) time on a mesh with multiple broadcasting of size n/spl times/n. The first algorithm is for an arbitrary point-set, while the second solves the problem in the special case when the points are the vertices of a convex polygon.<<ETX>>

[1]  Stephan Olariu,et al.  Simulating Enhanced Meshes, with Applications , 1993, Parallel Process. Lett..

[2]  Dionysios I. Reisis,et al.  Image Computations on Meshes with Multiple Broadcast , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Amotz Bar-Noy,et al.  Square meshes are not always optimal , 1989, SPAA '89.

[4]  Jerome Rothstein.  Bus automata, brains, and mental models , 1988, IEEE Trans. Syst. Man Cybern..

[5]  Stephan Olariu,et al.  A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications , 1994, J. Parallel Distributed Comput..

[6]  Uzi Vishkin,et al.  Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm , 1990, Discret. Appl. Math..

[7]  Jingyuan Zhang,et al.  Convex Polygon Problems on Meshes with Multiple Broadcasting , 1992, Parallel Process. Lett..

[8]  Stephan Olariu,et al.  A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting , 1993, Parallel Process. Lett..

[9]  Stephan Olariu,et al.  A Fast Selection Algorithm for Meshes with Multiple Broadcasting , 1994, IEEE Trans. Parallel Distributed Syst..

[10]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[11]  Stephan Olariu,et al.  Optimal convex hull algorithms on enhanced meshes , 1993, BIT Comput. Sci. Sect..

[12]  Hungwen Li,et al.  Connection Autonomy in SIMD Computers: A VLSI Implementation , 1989, J. Parallel Distributed Comput..

[13]  D. Parkinson,et al.  The AMT DAP 500 , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[14]  Stephan Olariu,et al.  Square Meshes Are Not Optimal For Convex Hull Computation , 1993, ICPP.

[15]  Jang-Ping Sheu,et al.  Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting , 1990, IEEE Trans. Parallel Distributed Syst..

[16]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

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

[18]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.