用矩形覆盖多边形的算法

Q4 Mathematics
D.S. Franzblau, D.J. Kleitman
{"title":"用矩形覆盖多边形的算法","authors":"D.S. Franzblau,&nbsp;D.J. Kleitman","doi":"10.1016/S0019-9958(84)80012-1","DOIUrl":null,"url":null,"abstract":"<div><p>Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applications in pattern recognition and integrated circuit manufacture. Here we examine the special case of covering a rectilinear polygon (or polyomino) with the minimum number of rectangles, with overlapping allowed. The problem is <em>NP</em>-hard. However, we give here an <em>O</em>(<em>v</em><sup>2</sup>) algorithm for constructing a minimum rectangle cover, when the polygon is vertically convex. (Here <em>v</em> is the number of vertices.) The problem is first reduced to a 1-dimensional interval “basis” problem. In showing our algorithm produces an optimal cover we give a new proof of a minimum basis-maximum independent set duality theorem first proved by E. Györi (<em>J. Combin Theory Ser. B</em> <strong>37</strong>, No. 1, 1–9).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80012-1","citationCount":"51","resultStr":"{\"title\":\"An algorithm for covering polygons with rectangles\",\"authors\":\"D.S. Franzblau,&nbsp;D.J. Kleitman\",\"doi\":\"10.1016/S0019-9958(84)80012-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applications in pattern recognition and integrated circuit manufacture. Here we examine the special case of covering a rectilinear polygon (or polyomino) with the minimum number of rectangles, with overlapping allowed. The problem is <em>NP</em>-hard. However, we give here an <em>O</em>(<em>v</em><sup>2</sup>) algorithm for constructing a minimum rectangle cover, when the polygon is vertically convex. (Here <em>v</em> is the number of vertices.) The problem is first reduced to a 1-dimensional interval “basis” problem. In showing our algorithm produces an optimal cover we give a new proof of a minimum basis-maximum independent set duality theorem first proved by E. Györi (<em>J. Combin Theory Ser. B</em> <strong>37</strong>, No. 1, 1–9).</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80012-1\",\"citationCount\":\"51\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995884800121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995884800121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 51

摘要

多边形分解是计算几何中的一个基本问题,在模式识别和集成电路制造中有着广泛的应用。在这里,我们研究了用最小数量的矩形覆盖一个直线多边形(或多项式)的特殊情况,允许重叠。问题是NP-hard。然而,我们在这里给出了一个O(v2)算法来构造最小矩形覆盖,当多边形是垂直凸的。(这里v是顶点的数量。)该问题首先被简化为一维区间“基”问题。在证明我们的算法产生最优覆盖时,我们给出了最早由E. Györi (J. Combin Theory Ser.)证明的最小基-最大独立集对偶定理的一个新的证明。B 37, No. 1, 1 - 9)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An algorithm for covering polygons with rectangles

Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applications in pattern recognition and integrated circuit manufacture. Here we examine the special case of covering a rectilinear polygon (or polyomino) with the minimum number of rectangles, with overlapping allowed. The problem is NP-hard. However, we give here an O(v2) algorithm for constructing a minimum rectangle cover, when the polygon is vertically convex. (Here v is the number of vertices.) The problem is first reduced to a 1-dimensional interval “basis” problem. In showing our algorithm produces an optimal cover we give a new proof of a minimum basis-maximum independent set duality theorem first proved by E. Györi (J. Combin Theory Ser. B 37, No. 1, 1–9).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信