Approximating the Convex Hull for a Set of Spheres


KIPS Transactions on Computer and Communication Systems, Vol. 3, No. 1, pp. 1-6, Jan. 2014
10.3745/KTCCS.2014.3.1.1,   PDF Download:

Abstract

Most of the previous algorithms focus on computing the convex hull for a set of points. In this paper, we present a method for approximating the convex hull for a set of spheres with various radii in discrete space. Computing the convex hull for a set of spheres is a base technology for many applications that study structural properties of molecules. We present a voxel map data structures, where the molecule is represented as a set of spheres, and corresponding algorithms. Based on CUDA programming for using the parallel architecture of GPU, our algorithm takes less than 40ms for computing the convex hull of 6,400 spheres in average.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. J. Kim, K. J. Kim and Y. J. Kim, "Approximating the Convex Hull for a Set of Spheres," KIPS Transactions on Computer and Communication Systems, vol. 3, no. 1, pp. 1-6, 2014. DOI: 10.3745/KTCCS.2014.3.1.1.

[ACM Style]
Byung Joo Kim, Ku Jin Kim, and Young J. Kim. 2014. Approximating the Convex Hull for a Set of Spheres. KIPS Transactions on Computer and Communication Systems, 3, 1, (2014), 1-6. DOI: 10.3745/KTCCS.2014.3.1.1.