The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we introduce a simple and efficient algorithm for computing the Voronoi Diagram for <it>n</it> planar points on a reconfigurable mesh of size <it>O</it>(<it>n</it>) ×<it>O</it>(<it>n</it>). The algorithm has a worst case running of <it>O</it>(log <it>n</it> log log <it>n</it>) time. The algorithm exploits the <it>O</it>(1) communication diameter of the reconfigurable mesh model to implement efficient load balancing.</p>
Parallel algorithms, reconfigurable mesh architectures, broadcasting buses, geometric algorithms, Voronoi diagram.
Hossam ElGindy, Lachlan Wetherall, "A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh", IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 1133-1142, November 1997, doi:10.1109/71.642948
109 ms
(Ver 3.3 (11022016))