A simple Voronoi diagram algorithm for a reconfigurable mesh

Authors:
Hossam A. ElGindy;Lachlan Wetherall
Affiliations:
-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 2

A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh

IEEE Transactions on Parallel and Distributed Systems
Geometric Data Structures on a Reconfigurable Mesh, with Applications

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(logn log logn) time, and O(logn) in practice. The algorithm exploits the O(1) communication diameter of the reconfigurable mesh model to implement efficient load balancing.