{"title":"An O(n2log n) time algorithm for the MinMax angle triangulation","authors":"H. Edelsbrunner, T. Tan, R. Waupotitsch","doi":"10.1145/98524.98535","DOIUrl":null,"url":null,"abstract":"<italic>We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n</italic><supscrpt>2</supscrpt> log <italic>n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.</italic>","PeriodicalId":113850,"journal":{"name":"SCG '90","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98524.98535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24
Abstract
We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
