| dc.creator (作者) | Liou,Wen-Ching ;C. Y. Tang;R. C. T. Lee | en_US |
| dc.creator (作者) | 劉文卿 | - |
| dc.date (日期) | 1991 | en_US |
| dc.date.accessioned | 17-Jan-2009 16:01:18 (UTC+8) | - |
| dc.date.available | 17-Jan-2009 16:01:18 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Jan-2009 16:01:18 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/27002 | - |
| dc.description.abstract (摘要) | In this paper, we discuss the problem of covering a convex rectilinear polygon with the minimum number of rectangles. The rectangles can overlap with each other. We show that this problem can be solved in linear time, which improves the previous O(n2) result proposed by Franzblau and Kleitman3. However, Franzblau and Kleitman`s algorithm works for a larger class of polygons (vertically convex). | - |
| dc.format | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | International Journal of Computational Geometry and Applications, 1(2), 137-185 | en_US |
| dc.title (題名) | Covering Convex Rectilinear Polygons in Linear Time | en_US |
| dc.type (資料類型) | article | en |
