A simple Voronoi diagram algorithm for a reconfigurable mesh
Hossam A. ElGindy, L. Wetherall · IEEE Transactions on Parallel and Distributed Systems · 1997
In this paper, we introduce a simple and efficient algorithm for computing the Voronoi Diagram for n planar points on a reconfigurable mesh of size O(n)/spl times/O(n). The algorithm has a worst case running of O(log n log log n) time. The algorithm exploits the O(1) communication diameter of the reconfigurable mesh model to implement efficient load balancing.