Experiments in the Parallel Computation of 3D Convex Hulls
| dc.contributor.author | Claret, A.R. | en_US |
| dc.contributor.author | Day, A.M. | en_US |
| dc.date.accessioned | 2014-10-21T07:29:15Z | |
| dc.date.available | 2014-10-21T07:29:15Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.description.number | 1 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 13 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.1310021 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 21-36 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.1310021 | en_US |
| dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | Experiments in the Parallel Computation of 3D Convex Hulls | en_US |