A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

1997
*
Theory of Computing Systems
*

We present a randomized parallel algorithm for constructing the threedimensional convex hull on a generic p-processor coarse-grained multicomputer with arbitrary interconnection network and n/ p local memory per processor, where n/ p ≥ p 2+ε (for some arbitrarily small ε > 0). For any given set of n points in 3-space, the algorithm computes the three-dimensional convex hull, with high probability, in O((n log n)/ p) local computation time and O(1) communication phases with at most O(n/ p) data

doi:10.1007/s002240000067
fatcat:outcwc7vqfdzlmlod7wriubpza