The Library
Parallel convex hull computation by generalised regular sampling
Tools
Tools
Tools
UNSPECIFIED (2002) Parallel convex hull computation by generalised regular sampling. In: 8th International Euro-Par Conference on Parallel Processing, PADERBORN, GERMANY, AUG 27-30, 2002. Published in: EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS, 2400 pp. 392-399.
Full text not available from this repository.Abstract
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. We propose the first optimal deterministic BSP algorithm for computing the convex hull of a set of points in three-dimensional Euclidean space. Our algorithm is based on known fundamental results from combinatorial geometry, concerning small-sized, efficiently constructible e-nets and c-approximations of a given point set. The algorithm generalises the technique of regular sampling, used previously for sorting and two-dimensional convex hull computation. The cost of the simple algorithm is optimal only for extremely large inputs; we show how to reduce the required input size by applying regular sampling in a multi-level fashion.
| Item Type: | Conference Item (UNSPECIFIED) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Series Name: | LECTURE NOTES IN COMPUTER SCIENCE |
| Journal or Publication Title: | EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS |
| Publisher: | SPRINGER-VERLAG BERLIN |
| ISBN: | 3-540-44049-6 |
| ISSN: | 0302-9743 |
| Editor: | Monien, B and Feldmann, R |
| Date: | 2002 |
| Volume: | 2400 |
| Number of Pages: | 8 |
| Page Range: | pp. 392-399 |
| Publication Status: | Published |
| Title of Event: | 8th International Euro-Par Conference on Parallel Processing |
| Location of Event: | PADERBORN, GERMANY |
| Date(s) of Event: | AUG 27-30, 2002 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/8588 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
