Title :
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams
Author :
Dehne, Frank ; Maheshwari, Anil ; Taylor, Ryan
Author_Institution :
Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.
Abstract :
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdorff Voronoi diagram for non-crossing objects in time O((n log4 n)/p) for input size n and p processors. In addition, our parallel algorithm also implies a new sequential HVD algorithm that constructs HVDs for non-crossing objects in time O(n log4 n). This improves on previous sequential results and solves an open problem posed by Papadopoulou and Lee (2004)
Keywords :
computational complexity; computational geometry; parallel algorithms; workstation clusters; Hausdorff Voronoi diagrams; cluster computing architectures; coarse grained parallel algorithm; computational complexity; Buildings; Circuit faults; Clustering algorithms; Computational geometry; Computer architecture; Computer science; Impurities; Manufacturing processes; Parallel algorithms; Very large scale integration;
Conference_Titel :
Parallel Processing, 2006. ICPP 2006. International Conference on
Conference_Location :
Columbus, OH
Print_ISBN :
0-7695-2636-5
DOI :
10.1109/ICPP.2006.5
