TY - GEN
T1 - Computing the convex hull for a set of spheres on a GPU
AU - Kim, Byungjoo
AU - Kim, Ku Jin
PY - 2012
Y1 - 2012
N2 - The convex hull is useful for detecting collisions between several objects in Virtual Reality system. It also is essential to define the boundary of an object that consists of several geometric primitives. There have been many researches on computing the convex hull of a set of points, but only a few researches consider the case when a set of spheres is given. Bradford et al. [Bradford et al. 1996] proposed quickhull algorithm, where it computes the convex hull of a point cloud by incrementally finding the extreme points and removing the inner points inside the region defined by the extreme points.
AB - The convex hull is useful for detecting collisions between several objects in Virtual Reality system. It also is essential to define the boundary of an object that consists of several geometric primitives. There have been many researches on computing the convex hull of a set of points, but only a few researches consider the case when a set of spheres is given. Bradford et al. [Bradford et al. 1996] proposed quickhull algorithm, where it computes the convex hull of a point cloud by incrementally finding the extreme points and removing the inner points inside the region defined by the extreme points.
UR - http://www.scopus.com/inward/record.url?scp=84872281256&partnerID=8YFLogxK
U2 - 10.1145/2407516.2407596
DO - 10.1145/2407516.2407596
M3 - Conference contribution
AN - SCOPUS:84872281256
SN - 9781450318259
T3 - Proceedings - VRCAI 2012: 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
SP - 345
BT - Proceedings - VRCAI 2012
T2 - 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry, VRCAI 2012
Y2 - 2 December 2012 through 4 December 2012
ER -