2017³â Ãß°èÇмú´ëȸ
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
ÁÂÇ¥Ãà¿¡ ÆòÇàÇÑ Á÷»ç°¢ÇüµéÀÇ ÇÕÁýÇÕÀ» ±¸ÇÏ´Â »ó¼ö½Ã°£ RMESH ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A Constant Time RMESH Algorithm for the Union of Iso-Oriented Rectangles |
ÀúÀÚ(Author) |
±è¼öȯ
ÃÖÁø¿À
Soo-Hwan Kim
Jinoh Choi
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 21 NO. 02 PP. 0627 ~ 0629 (2017. 10) |
Çѱ۳»¿ë (Korean Abstract) |
Æò¸é »ó¿¡ ÁÖ¾îÁø °³ÀÇ Á÷»ç°¢Çü¿¡ ´ëÇÑ ÇÕÁýÇÕ°ú ±³ÁýÇÕÀ» ±¸ÇÏ´Â ¹®Á¦¿¡ ´ëÇØ ¸¹Àº ¿¬±¸ °á°ú°¡ ³ª¿Í ÀÖ´Ù. Lipski¿Í Preparata(1981)´Â ÁÂÇ¥Ãà¿¡ ÆòÇàÇÑ Á÷»ç°¢ÇüÀÇ ÇÕÁýÇÕÀ» ±¸ÇÏ´Â ¹®Á¦¿¡ ´ëÇؼ O(nlogn) ½Ã°£°ú O(nlogn) °ø°£ÀÇ ¼øÂ÷ ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÏ¿´°í[1], Alevizos(2013)´Â À̸¦ °³¼±ÇÑ O(nlogn) ½Ã°£°ú O(n) °ø°£ÀÇ °³¼±µÈ ¼øÂ÷ ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÏ¿´´Ù[2]. º» ³í¹®¿¡¼´Â ÁÂÇ¥Ãà¿¡ ÆòÇàÇÑ Á÷»ç°¢ÇüµéÀÇ ±³ÁýÇÕÀÌ °øÁýÇÕÀÌ ¾Æ´Ñ °æ¿ì¿¡ ´ëÇÑ Á÷»ç°¢ÇüµéÀÇ ÇÕÁýÇÕÀ» ±¸ÇÏ´Â ¹®Á¦¸¦ °í·ÁÇÑ´Ù. ÀÌ °æ¿ì, Á÷»ç°¢ÇüµéÀÇ ÇÕÁýÇÕÀº ÇϳªÀÇ ¿¬°áµÈ ¿µ¿ª, Áï Á÷±³´Ù°¢ÇüÀÌ µÈ´Ù. º» ³í¹®¿¡¼´Â À籸¼º°¡´ÉÇÑ ¸Þ½¬(RMESH) ¸ðµ¨¿¡¼ »ó¼ö ½Ã°£¿¡ ÀÌ ¹®Á¦¸¦ ÇØ°áÇÏ´Â º´·Ä ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
There are a lot of research results on the problem of finding the union and intersection of n rectangles on a plane. Lipski¿Í Preparata(1981) presented a sequential algorithm with O(nlogn) time and O(nlogn) space for the problem of finding the union of rectangles whose sides are parallel to the coordinate axes[1]. Alevizos(2013) presented an improved O(nlogn) time and O(n) space algorithm for the same problem[2]. In this paper, we consider the problem of finding the union of iso-oriented rectangles such that the intersection of them is not an empty set. In this case, the union of the rectangles becomes a connected area, that is, an orthogonal polygon. In this paper, we propose a parallel algorithm that solves this problem in constant time in a reconfigurable mesh(in short, RMESH) model.
|
Å°¿öµå(Keyword) |
Reconfigurable mesh
Parallel algorithm
Iso-oriented Rectangles
Union
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|