{"title":"A Predictor-Corrector Type Incremental Algorithm for Weighted Straight Skeletons","authors":"B. Irhan","doi":"10.14733/CADCONFP.2021.56-60","DOIUrl":null,"url":null,"abstract":"Introduction: In classical straight skeleton problem, each edge of the polygon moves inwards with a constant unit velocity in such a way that it remains essentially parallel to itself throughout the course of the shrinking process. The regions swept by the polygon edges construct the faces of the straight skeleton structure of the underlying polygon. During the shrinking process, polygon topology might change due to edge collapse and edge split events. The edge collapse event takes place at an instance when at least one edge of the polygon collapses down to a point, whereas the edge split event comes into play as at least one of the vertices hits an edge or another vertex of the polygon. The existing algorithms for the construction of straight skeletons are based on wave propagation and they make use of the additional tools like kinetic triangulation [1] or motorcycle graph [2]. The weighted version of the straight skeleton algorithm was pioneered in [3].","PeriodicalId":166025,"journal":{"name":"CAD'21 Proceedings","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CAD'21 Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14733/CADCONFP.2021.56-60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Introduction: In classical straight skeleton problem, each edge of the polygon moves inwards with a constant unit velocity in such a way that it remains essentially parallel to itself throughout the course of the shrinking process. The regions swept by the polygon edges construct the faces of the straight skeleton structure of the underlying polygon. During the shrinking process, polygon topology might change due to edge collapse and edge split events. The edge collapse event takes place at an instance when at least one edge of the polygon collapses down to a point, whereas the edge split event comes into play as at least one of the vertices hits an edge or another vertex of the polygon. The existing algorithms for the construction of straight skeletons are based on wave propagation and they make use of the additional tools like kinetic triangulation [1] or motorcycle graph [2]. The weighted version of the straight skeleton algorithm was pioneered in [3].