gHull: a three-dimensional convex hull algorithm for graphics hardware
暂无分享,去创建一个
We present a novel approach, termed gHull, to compute the convex hull for a 3D point set using the GPU. We exploit the fast computation of the digital Voronoi diagram and its relationship with the convex hull to compute the answer from the former rather than directly. Our algorithm is robust, while able to maximizes the parallelism available in the GPU to achieve significant speed up.
[1] Jonathan Richard Shewchuk,et al. Star splaying: an algorithm for repairing delaunay triangulations and convex hulls , 2005, SCG.
[2] David P. Dobkin,et al. The quickhull algorithm for convex hulls , 1996, TOMS.
[3] Tiow Seng Tan,et al. Parallel Banding Algorithm to compute exact distance transform with the GPU , 2010, I3D '10.