A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams

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 noncrossing objects in time O(n log4 n). This improves on previous sequential results and solves an open problem posed by Papadopoulou and Lee [18].

• Type: Conference
• Year: 2006
• Where: ICPP
• Authors: Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor
• Keywords: Distributed And Parallel Computing, Hausdorff Voronoi Diagram, ICPP 2006, Parallel Algorithm, first Parallel Algorithm