A simple Voronoi diagram algorithm for a reconfigurable mesh |
| |
Authors: | ElGindy H. Wetherall L. |
| |
Affiliation: | Dept. of Comput. Sci., Newcastle Univ., NSW; |
| |
Abstract: | 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)×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 |
| |
Keywords: | |
|
|