Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, Saurabh Ray
{"title":"Sweeping Arrangements of Non-Piercing Regions in the Plane","authors":"Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, 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.
期刊介绍:
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.