Computing the convex hull for a set of spheres on a GPU
Byungjoo Kim, Ku-Jin Kim
Proceedings of the 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry, 2012, pp. 345--345.
Abstract: 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.
Article URL: http://doi.acm.org/10.1145/2407516.2407596
BibTeX format:
@inproceedings{10.1145-2407516.2407596,
  author = {Byungjoo Kim and Ku-Jin Kim},
  title = {Computing the convex hull for a set of spheres on a GPU},
  booktitle = {Proceedings of the 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry},
  pages = {345--345},
  year = {2012},
}
Search for more articles by Byungjoo Kim.
Search for more articles by Ku-Jin Kim.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."