Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ÄÄÇ»ÅÍ ¹× Åë½Å½Ã½ºÅÛ
Current Result Document : 2 / 3
ÇѱÛÁ¦¸ñ(Korean Title) |
±¸ ÁýÇÕ¿¡ ´ëÇÑ ÄÁº¤½ºÇæ ±Ù»ç |
¿µ¹®Á¦¸ñ(English Title) |
Approximating the Convex Hull for a Set of Spheres |
ÀúÀÚ(Author) |
±èº´ÁÖ
±è±¸Áø
±è¿µÁØ
Byungjoo Kim
Ku-Jin Kim
Young J. Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 03 NO. 01 PP. 0001 ~ 0006 (2014. 01) |
Çѱ۳»¿ë (Korean Abstract) |
ÇöÀç±îÁö ÄÁº¤½ºÇæ (convex hull) ÀÇ °è»ê ¾Ë°í¸®ÁòµéÀº ÁÖ·Î Á¡ ÁýÇÕ (point set) ¿¡ ´ëÇØ ¿¬±¸°¡ ¼öÇàµÇ¾î ¿Ô´Ù. º» ³í¹®¿¡¼´Â ÀÌ»ê °ø°£¿¡¼ ´Ù¾çÇÑ ¹Ý°æÀ» °®´Â ±¸ ÁýÇÕ¿¡ ´ëÇÑ ÄÁº¤½ºÇæÀ» ±Ù»çÇÏ´Â ¹æ¹ýÀ» Á¦½ÃÇÑ´Ù. ±¸ ÁýÇÕ¿¡ ´ëÇÑ ÄÁº¤½ºÇæ °è»êÀº, ƯÈ÷ ´Ü¹éÁú ºÐÀÚÀÇ ±¸Á¶ÀûÀΠƯ¼ºÀ» ¿¬±¸ÇÏ´Â ¿©·¯ ÀÀ¿ëºÐ¾ß¿¡¼ °è»ê È¿À²¼ºÀ» Áõ´ë½ÃÅ°±â À§ÇÑ ±â¹Ý ±â¼úÀ̶ó ÇÒ ¼ö ÀÖ´Ù. ºÐÀÚ¿¡ ´ëÀÀÇÏ´Â ±¸ÀÇ ÁýÇÕ¿¡ ´ëÇØ º¹¼¿ ¸Ê(voxel map) ÀڷᱸÁ¶¸¦ Àû¿ëÇÏ°í À̸¦ ÀÌ¿ëÇÏ¿© ÄÁº¤½ºÇæÀ» °è»êÇÏ´Â ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. Á¦¾ÈµÈ ¹æ¹ýÀº GPU¸¦ È°¿ëÇÑ º´·Ä󸮸¦ ¼öÇàÇÏ¿© Æò±ÕÀûÀ¸·Î 6,400°³ ÀÌÇÏÀÇ ±¸°¡ Æ÷ÇÔµÈ ÁýÇÕ¿¡ ´ëÇØ 40ms À̳»¿¡ ÄÁº¤½ºÇæÀ» °è»êÇÏ´Â ¼º´ÉÀ» º¸ÀδÙ. |
¿µ¹®³»¿ë (English 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. |
Å°¿öµå(Keyword) |
ÄÁº¤½ºÇæ
±¸
´Ü¹éÁú ºÐÀÚ
ºÐÀÚ ÀÎÅÍÆäÀ̽º
GPU
Convex Hull
Spheres
Protein Molecule
Molecular Interface
GPU
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|