Sweeping Arrangements of Non-Piercing Regions in the Plane

IF 1 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray
{"title":"Sweeping Arrangements of Non-Piercing Regions in the Plane","authors":"Suryendu Dalal,&nbsp;Rahul Gangopadhyay,&nbsp;Rajiv Raman,&nbsp;Saurabh Ray","doi":"10.1007/s00453-026-01380-w","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span>\\(\\Gamma \\)</span> be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve <span>\\(\\gamma \\in \\Gamma \\)</span>, we denote the bounded region enclosed by <span>\\(\\gamma \\)</span> as <span>\\(\\tilde{\\gamma }\\)</span>. We say that <span>\\(\\Gamma \\)</span> is non-piercing if for any two curves <span>\\(\\alpha , \\beta \\in \\Gamma \\)</span>, both <span>\\(\\tilde{\\alpha } \\,\\setminus \\, \\tilde{\\beta }\\)</span> and <span>\\(\\tilde{\\beta }\\,\\setminus \\,\\tilde{\\beta }\\)</span> is connected. A non-piercing arrangement of curves generalizes a set of 2-intersecting curves in which each pair of curves intersect in at most two points. Snoeyink and Hershberger (“Sweeping Arrangements of Curves”, SoCG ’89) proved that if we are given an arrangement <span>\\(\\Gamma \\)</span> of 2-intersecting curves and a <i>sweep</i> curve <span>\\(\\gamma \\in {\\Gamma }\\)</span>, then the arrangement can be <i>swept</i> by <span>\\(\\gamma \\)</span> while always maintaining the 2-intersecting property of the curves in <span>\\(\\Gamma \\)</span>. We generalize the result of Snoeyink and Hershberger to the setting of non-piercing arrangements. Given an arrangement <span>\\(\\Gamma \\)</span> of non-piercing curves, a sweep curve <span>\\(\\gamma \\in \\Gamma \\)</span>, and a point <i>P</i> in <span>\\(\\tilde{\\gamma }\\)</span>, we show that we can continuously shrink <span>\\(\\gamma \\)</span> to <i>P</i> so that throughout the process, the arrangement remains non-piercing (except at a finite set of points in time where <span>\\(\\gamma \\)</span> crosses other curves), and <i>P</i> lies in <span>\\(\\tilde{\\gamma }\\)</span>. We show that our arguments can be modified if <i>P</i> lies outside <span>\\(\\tilde{\\gamma }\\)</span>, and we want to sweep <span>\\(\\gamma \\)</span> <i>outwards</i> so that <i>P</i> lies outside <span>\\(\\tilde{\\gamma }\\)</span>, and the arrangement remains non-piercing. We give several applications of our results to combinatorial and algorithmic questions including to the <i>multi-hitting set</i> problem involving points and non-piercing regions.</p></div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"88 2","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2026-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithmica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00453-026-01380-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Let \(\Gamma \) be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve \(\gamma \in \Gamma \), we denote the bounded region enclosed by \(\gamma \) as \(\tilde{\gamma }\). We say that \(\Gamma \) is non-piercing if for any two curves \(\alpha , \beta \in \Gamma \), both \(\tilde{\alpha } \,\setminus \, \tilde{\beta }\) and \(\tilde{\beta }\,\setminus \,\tilde{\beta }\) is connected. A non-piercing arrangement of curves generalizes a set of 2-intersecting curves in which each pair of curves intersect in at most two points. Snoeyink and Hershberger (“Sweeping Arrangements of Curves”, SoCG ’89) proved that if we are given an arrangement \(\Gamma \) of 2-intersecting curves and a sweep curve \(\gamma \in {\Gamma }\), then the arrangement can be swept by \(\gamma \) while always maintaining the 2-intersecting property of the curves in \(\Gamma \). We generalize the result of Snoeyink and Hershberger to the setting of non-piercing arrangements. Given an arrangement \(\Gamma \) of non-piercing curves, a sweep curve \(\gamma \in \Gamma \), and a point P in \(\tilde{\gamma }\), we show that we can continuously shrink \(\gamma \) to P so that throughout the process, the arrangement remains non-piercing (except at a finite set of points in time where \(\gamma \) crosses other curves), and P lies in \(\tilde{\gamma }\). We show that our arguments can be modified if P lies outside \(\tilde{\gamma }\), and we want to sweep \(\gamma \) outwards so that P lies outside \(\tilde{\gamma }\), and the arrangement remains non-piercing. We give several applications of our results to combinatorial and algorithmic questions including to the multi-hitting set problem involving points and non-piercing regions.

Abstract Image

平面上非穿孔区域的清扫布置
设\(\Gamma \)为平面内约旦曲线的排列,即平面内的简单封闭曲线。对于任意曲线\(\gamma \in \Gamma \),我们将\(\gamma \)包围的有界区域表示为\(\tilde{\gamma }\)。我们说,如果对于任意两条曲线\(\alpha , \beta \in \Gamma \), \(\tilde{\alpha } \,\setminus \, \tilde{\beta }\)和\(\tilde{\beta }\,\setminus \,\tilde{\beta }\)是连通的,那么\(\Gamma \)是不穿洞的。曲线的非穿透排列概括了一组两相交的曲线,其中每对曲线最多相交于两点。Snoeyink和Hershberger(“曲线的清扫布置”,SoCG ' 89)证明,如果给定两相交曲线的排列\(\Gamma \)和一条清扫曲线\(\gamma \in {\Gamma }\),则该排列可以在保持\(\Gamma \)中曲线的两相交性质的同时被\(\gamma \)清扫。我们将Snoeyink和Hershberger的结果推广到非穿孔布置的设置。给定无穿洞曲线的排列\(\Gamma \),扫描曲线\(\gamma \in \Gamma \)和\(\tilde{\gamma }\)中的点P,我们证明我们可以连续地将\(\gamma \)收缩到P,以便在整个过程中,该排列保持无穿洞(除了\(\gamma \)与其他曲线相交的有限时间点集),并且P位于\(\tilde{\gamma }\)。我们表明,如果P位于\(\tilde{\gamma }\)之外,我们的参数可以被修改,并且我们想要向外扫\(\gamma \),以便P位于\(\tilde{\gamma }\)之外,并且安排仍然是非穿刺的。我们给出了我们的结果在组合问题和算法问题上的几个应用,包括涉及点和非穿透区域的多命中集问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algorithmica
Algorithmica 工程技术-计算机:软件工程
CiteScore
2.80
自引率
9.10%
发文量
158
审稿时长
12 months
期刊介绍: Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal for practical importance or techniques. The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential. Algorithmica covers algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. In addition, the journal features two special sections: Application Experience, presenting findings obtained from applications of theoretical results to practical situations, and Problems, offering short papers presenting problems on selected topics of computer science.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书