一个O(n2log n)时间的最小最大角三角剖分算法

SCG '90 Pub Date : 1990-05-01 DOI:10.1145/98524.98535

H. Edelsbrunner, T. Tan, R. Waupotitsch

{"title":"一个O(n2log n)时间的最小最大角三角剖分算法","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":"{\"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}","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

摘要

我们证明了平面上n个点的三角剖分可以在时间O(n2 log n)和空间O(n)内计算出最小化最大角度的集合。在相同的时间和空间中，我们还可以处理边是规定的约束情况。该算法迭代地改进了任意初始三角剖分，实现起来相当容易。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An O(n2log n) time algorithm for the MinMax angle triangulation

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SCG '90

自引率

0.00%

发文量