政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/26982

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 112721/143689 (78%)
Visitors : 49502979 Online Users : 683

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 > Item 140.119/26982

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/26982

Title:	Minimum Rectangular Partition Problem for Simple Rectilinear Polygons
Authors:	Liou,Wen-Ching;Tan J. J. M.;Lee, R. C. T 劉文卿
Date:	1990-07
Issue Date:	2009-01-17 15:59:24 (UTC+8)
Abstract:	An O(n log log n) algorithm is proposed for minimally rectangular partitioning a simple rectilinear polygon. For any simple rectilinear polygon P, a vertex-edge visible pair is a vertex and an edge that can be connected by a horizontal or vertical line segment that lies entirely inside P. It is shown that, if the vertex-edge visible pairs are found, the maximum matching and the maximum independent set of the bipartite graph derived from the chords of a simple rectilinear polygon can be found in linear time without constructing the bipartite graph. Using this algorithm, the minimum partition problem for convex rectilinear polygons and vertically (horizontally) convex rectilinear polygons can be solved in O(n) time
Relation:	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 9(7), 720-733
Data Type:	article
Appears in Collections:	[資訊管理學系] 期刊論文

Files in This Item:

File	Size	Format
index.html	0Kb	HTML2	1158	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...