An efficient convex hull computation on the reconfigurable mesh

Presents a fast parallel solution to the convex hull problem on a two dimensional reconfigurable mesh. The parallel algorithm computes the convex hull of N/sup 1/2/ planar points on a N/sup 1/2/*N/sup 1/2/ reconfigurable mesh. The algorithm is very efficient and completes the convex hull computation in O(1) time. Efficient parallel sorting of N/sup 1/2/ data items on the reconfigurable mesh and improved parallel enumerating techniques utilized as basic steps in the convex hull computation are also shown.<<ETX>>

[1]  Dionysios I. Reisis,et al.  Image computations on reconfigurable VLSI arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

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

[3]  Quentin F. Stout,et al.  Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[5]  Russ Miller,et al.  Meshes with reconfigurable buses , 1988 .

[6]  Dionysios I. Reisis,et al.  VLSI Arrays with Reconfigurable Buses , 1988, ICS.