Conference paper
PARALLEL COMPUTATIONAL GEOMETRY.
Abstract
The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.
Related
Conference paper
The multi-tree approach to reliability in distributed networks
Conference paper
Parallel communication with limited buffers
Conference paper