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^1/2 planar points on a N^1/2×N^1/2 reconfigurable mesh. The algorithm is very efficient and completes the convex hull computation in O(1) time. Efficient parallel sorting of N^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