Name
Abstract | ||
|---|---|---|
A novel algorithm is presented to compute the convex hull of a point set in ℝ3 using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, the algorithm derives the approximation of the convex hull from the former. The other extreme vertices of the convex hull are then found by using a two-round checking in the digital and the continuous space successively. The algorithm does not need explicit locking or any other concurrency control mechanism, thus it can maximize the parallelism available on the modern GPU. The implementation using the CUDA programming model on NVIDIA GPUs is exact and efficient. The experiments show that it is up to an order of magnitude faster than other sequential convex hull implementations running on the CPU for inputs of millions of points. The works demonstrate that the GPU can be used to solve nontrivial computational geometry problems with significant performance benefit. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2513109.2513112 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
convex hull,sequential convex hull,gpu algorithm,modern gpu,continuous space,extreme vertex,cuda programming model,concurrency control mechanism,novel algorithm,nvidia gpus,voronoi diagram,gpgpu | Mathematical optimization,Alpha shape,Computational geometry,Convex hull,Algorithm,Theoretical computer science,General-purpose computing on graphics processing units,Voronoi diagram,Output-sensitive algorithm,Proper convex function,Gift wrapping algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
40 | 1 | 0098-3500 |
Citations | PageRank | References |
4 | 0.41 | 20 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingcen Gao | 1 | 19 | 2.07 |
| Thanh-Tung Cao | 2 | 145 | 7.31 |
| Ashwin Nanjappa | 3 | 10 | 0.87 |
| Tiow-Seng Tan | 4 | 398 | 27.99 |
| Zhiyong Huang | 5 | 106 | 11.79 |