Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
È÷½ºÅä±×·¥À» Á÷»ç°¢Çüµé·Î ºÐÇÒÇÏ´Â ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Rectangular Partitioning Algorithm for Histograms |
ÀúÀÚ(Author) |
±èÈÖ
¾ÈÈñ°©
Hwi Kim
Hee-Kap Ahn
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 28 NO. 02 PP. 0128 ~ 0133 (2022. 02) |
Çѱ۳»¿ë (Korean Abstract) |
È÷½ºÅä±×·¥ÀÇ Á÷»ç°¢Çü ºÐÇÒÀ̶õ È÷½ºÅä±×·¥ ³»ºÎ¿¡ ¼±ºÐµéÀ» ±×¾î ³ª´¶ Á÷»ç°¢ÇüµéÀÇ ÁýÇÕÀ» ÀǹÌÇÑ´Ù. À̶§ °¢ ¼±ºÐÀº È÷½ºÅä±×·¥ÀÇ ¿À¸ñ ²ÀÁþÁ¡¿¡ ÀÎÁ¢ÇÑ °Íµé·Î Á¦ÇѵȴÙ. ÀÌ ³í¹®Àº È÷½ºÅä±×·¥ÀÇ Á÷»ç°¢Çü ºÐÇÒ °¡¿îµ¥ ³ª´¶ Á÷»ç°¢Çüµé Áß °¡Àå ªÀº º¯ÀÇ ±æÀÌ°¡ ÃÖ´ëÀÎ °ÍÀ» °è»êÇÏ´Â ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. ÀÌ ¾Ë°í¸®ÁòÀº È÷½ºÅä±×·¥ÀÇ Æ¯¼öÇÑ °æ¿ìÀÎ ÄÉÀÌÅ©¿Í °è´ÜÀÇ µÎ²¨¿î ºÐÇÒÀ» °è»êÇÏ´Â ¾Ë°í¸®ÁòÀ» ¼ºê·çƾÀ¸·Î »ç¿ëÇϸç, ºÐÇÒÀ» ±¸¼ºÇÏ´Â ¼±ºÐµéÀÌ Æ¯Á¤ Á¶°ÇÀ» ¸¸Á·Çϵµ·Ï ÇÏ´Â È÷½ºÅä±×·¥ÀÇ µÎ²¨¿î ºÐÇÒÀÌ Ç×»ó Á¸ÀçÇÑ´Ù´Â °üÂûÀ» ÅëÇØ Å½»ö °ø°£ÀÇ Å©±â¸¦ ÁÙÀÓÀ¸·Î½á ¼±Çü ½Ã°£°ú °ø°£À» ´Þ¼ºÇÑ´Ù. ÀÌ ¾Ë°í¸®ÁòÀÇ ÀÀ¿ë ºÐ¾ß·Î´Â À̹ÌÁö ó¸®¿Í VLSI µðÀÚÀÎ µîÀÌ ÀÖ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
We investigate the problem of partitioning a histogram H with n vertices into rectangles using disjoint line segments drawn inside H. We develop a dynamic programming algorithm that computes a thick partition of H, which maximizes the minimum side length over all resulting rectangles. As subroutines, it uses algorithms that compute a thick partition of cakes and staircases, two special kinds of histograms. We observe that there always exists a thick partition of H such that the line segments constituting the partition satisfy certain conditions. Based on this observation, the algorithm computes a thick partition in O(n) time and space. The algorithm can be useful in processing digital images and designing very-large-scale integration (VLSI) layouts. |
Å°¿öµå(Keyword) |
È÷½ºÅä±×·¥
Á÷»ç°¢Çü ºÐÇÒ
VLSI ·¹À̾ƿô µðÀÚÀÎ
ÃÖ¼Ò º¯ ±æÀÌ
histogram
rectangular partition
VLSI layout design
minimum side length
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|