{"title":"On the optimal bisection of a polygon (extended abstract)","authors":"E. Koutsoupias, C. Papadimitriou, M. Sideri","doi":"10.1145/98524.98565","DOIUrl":null,"url":null,"abstract":"We give a polynomial approximation sceme for subdividing a simple polygon into approximately equal parts by curves of the smallest possible total length. For convex polygons we show that an exact fast algorithm is possible. Several generalizations are shown NP-complete.","PeriodicalId":113850,"journal":{"name":"SCG '90","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98524.98565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We give a polynomial approximation sceme for subdividing a simple polygon into approximately equal parts by curves of the smallest possible total length. For convex polygons we show that an exact fast algorithm is possible. Several generalizations are shown NP-complete.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
