Publication View

A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams (2008)

Abstract
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 for input � size � and processors. In addition, our parallel algorithm also implies a new sequential HVD algorithm that constructs HVDs for non-crossing objects in time  ¢¡ sequential results and solves an open problem posed by

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.120.5286
Source http://www.scs.carleton.ca/~maheshwa/papers/parallel-hvd.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type text
Language English
Relation 10.1.1.127.6527, 10.1.1.44.3924, 10.1.1.5.9084, 10.1.1.10.1355, 10.1.1.53.6807, 10.1.1.9.3393