Experiments in the Parallel Computation of 3D Convex Hulls
View/
Date
1994Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
Two parallel implementations of a 3D convex hull algorithm are reported. The paper considers a MIMD distributed memory architecture and the implementations are carried out on the Meiko Computing Surface using T800 transputers and the programming languages Occam and C. The first method uses a simple parallel geometric decomposition strategy and produces encouraging results. With the second approach a parallel generic Divide-and-Conquer kernel is incorporated. This is an example of the algorithmic skeleton approach to parallel programming and involves run-time, dynamic allocation of work to processors. The resulting performances for both methods are measured and compared.
BibTeX
@article {10.1111:1467-8659.1310021,
journal = {Computer Graphics Forum},
title = {{Experiments in the Parallel Computation of 3D Convex Hulls}},
author = {Claret, A.R. and Day, A.M.},
year = {1994},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1310021}
}
journal = {Computer Graphics Forum},
title = {{Experiments in the Parallel Computation of 3D Convex Hulls}},
author = {Claret, A.R. and Day, A.M.},
year = {1994},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1310021}
}