Please use this identifier to cite or link to this item:
|Title:||GHull: A GPU algorithm for 3D convex hull|
|Citation:||Gao, M., Cao, T.-T., Nanjappa, A., Tan, T.-S., Huang, Z. (2013). GHull: A GPU algorithm for 3D convex hull. ACM Transactions on Mathematical Software 40 (1) : -. ScholarBank@NUS Repository. https://doi.org/10.1145/2513109.2513112|
|Abstract:||A novel algorithm is presented to compute the convex hull of a point set in R3 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. © 2013 ACM.|
|Source Title:||ACM Transactions on Mathematical Software|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jun 18, 2018
checked on Jun 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.