Á¤º¸°úÇÐȸ ³í¹®Áö A : ½Ã½ºÅÛ ¹× ÀÌ·Ð
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
k-DOPÀ» ÀÌ¿ëÇÏ¿© 2Â÷¿ø º¼·Ï ´Ù°¢Çü°£ÀÇ Hausdorff °Å¸®¸¦ °è»êÇÏ´Â È¿À²ÀûÀÎ ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
An Efficient Algorithm for Hausdorff Distance Computation of 2D Convex Polygons using k-DOPs |
ÀúÀÚ(Author) |
ÀÌÁöÀº
±è¿ëÁØ
Jieun Lee
Yong-Jun Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 36 NO. 02 PP. 0111 ~ 0123 (2009. 04) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â µÎ °³ÀÇ ÀÌÂ÷¿ø º¼·Ï ´Ù°¢Çü°£ÀÇ Hausdorff °Å¸®¸¦ °è»êÇÏ´Â È¿À²ÀûÀÎ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. º¼·Ï ´Ù°¢ÇüÀ» k-DOPÀ¸·Î ¹Ù¿îµùÇÏ°í, k-DOPÀÇ ¹æÇ⼺°ú °èÃþÀûÀΠƯ¼º¿¡ µû¶ó °ü½É¿µ¿ª¸¸À» ÃßÀûÇÏ´Â ¹æ¹ýÀ¸·Î, º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀº Æò±ÕÀûÀ¸·Î O(logn)½Ã°£¿¡ ¼öÇàµÇ¸ç, ÃÖ¾ÇÀÇ °æ¿ì¿¡µµ O(n)ÀÇ ¼öÇ༺´ÉÀ» º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
We present an efficient algorithm for computing the Hausdorff distance between two 2D convex polygons. Two convex polygons are bounded by k-DOPs and the regions of interest are traced using the orientational and hierarchical properties of k-DOP. The algorithm runs in a logarithmic time in the average case, and the worst case time complexity is linear.
|
Å°¿öµå(Keyword) |
Hausdorff °Å¸®
k-DOP
º¼·Ï ´Ù°¢Çü
±âÇÏÇÐÀû ¾Ë°í¸®Áò
Hausdorff distance
k-DOP
convex polygon
geometric algorithm
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|