Experiments in the Parallel Computation of 3D Convex Hulls

dc.contributor.authorClaret, A.R.en_US
dc.contributor.authorDay, A.M.en_US
dc.date.accessioned2014-10-21T07:29:15Z
dc.date.available2014-10-21T07:29:15Z
dc.date.issued1994en_US
dc.description.abstractTwo 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.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume13en_US
dc.identifier.doi10.1111/1467-8659.1310021en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages21-36en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1310021en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleExperiments in the Parallel Computation of 3D Convex Hullsen_US
Files
Collections