Two parallel implementations of a 3D convex hull algorithm are reported. The paper considers a MIMD distributed memory architecture and the implementations ...
Original language, English. Pages (from-to), 21-36. Number of pages, 16. Journal, Computer Graphics Forum. Volume, 13. Issue number, 1.
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. Journal of Parallel and Distributed. Computing, 63(4):488–500, April 2003.
The paper presents a parallel implementation of a 3D convex-hull algorithm on a Meiko Computing Surface using occam and c. The parallel program is adapted ...
Jun 29, 1990 · The paper presents a parallel implementation of a 3D convex-hull algorithm on a Meiko Computing Suriace using occA,~ and c.
The Parallel Computation of 3D Convex Hulls. Paper presented at Graphicon '93, The 3rd Conference on Computer Graphics and Visualisation.
Missing: Experiments | Show results with:Experiments
We present a randomized parallel algorithm for constructing the three-dimensional convex hull on a generic p-processor coarse-grained multicomputer with ...
Nov 1, 1990 · In this paper we establish a correct ”local” criterion for computing the convex hull of the union ( "merging” ) of two disjoint convex ...
In this section we present a relatively simple algo- rithm that computes the convex hull of n points in. O(log n) time using. O(n2) processors on a CREW. PRAM.
In this paper, we present a novel pruning-based approach for finding the convex hull set for 2D and 3D datasets using parallel algorithms. This approach, which ...
Missing: Experiments | Show results with:Experiments