{"title":"Constructing the Internal Voronoi Diagram of Polygonal Figure Using the Sweepline Method","authors":"L. M. Mestetskiy, D. A. Koptelov","doi":"10.1134/s0361768824700105","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The problem of constructing the internal Voronoi diagram of a polygonal figure—a polygon with polygonal holes—is considered. A method based on the plane sweep paradigm is proposed. Direct construction of only the internal part of the Voronoi diagram allows us to reduce the amount of computations and increase robustness compared to known solutions. Another factor in reducing the computational complexity is the use of the property of pairwise incidence of linear segments formed by the sides of the polygonal figure. To take these features into account, it is proposed to build a data structure called <i>sweep line</i> <i>status</i> in the form of an ordered set of sites’ areas of responsibility. This structure is implemented as a combination of a balanced tree and a bidirectional list. Computational experiments illustrate the numerical reliability and efficiency of the proposed method.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programming and Computer Software","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0361768824700105","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
The problem of constructing the internal Voronoi diagram of a polygonal figure—a polygon with polygonal holes—is considered. A method based on the plane sweep paradigm is proposed. Direct construction of only the internal part of the Voronoi diagram allows us to reduce the amount of computations and increase robustness compared to known solutions. Another factor in reducing the computational complexity is the use of the property of pairwise incidence of linear segments formed by the sides of the polygonal figure. To take these features into account, it is proposed to build a data structure called sweep linestatus in the form of an ordered set of sites’ areas of responsibility. This structure is implemented as a combination of a balanced tree and a bidirectional list. Computational experiments illustrate the numerical reliability and efficiency of the proposed method.
期刊介绍：
Programming and Computer Software is a peer reviewed journal devoted to problems in all areas of computer science: operating systems, compiler technology, software engineering, artificial intelligence, etc.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
