2006 International Conference on Parallel Processing (ICPP'06) A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams Columbus, Ohio August 14-August 18 ISBN: 0-7695-2636-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2006.5
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 log^4 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 log^4 n). This improves on previous sequential results and solves an open problem posed by Papadopoulou and Lee [18].
Citation:
Frank Dehne, Anil Maheshwari, Ryan Taylor, "A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams," icpp, pp.497-504, 2006 International Conference on Parallel Processing (ICPP'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||