简单多边形三角化的时空权衡

Q4 Mathematics

International Journal of Computational Geometry & Applications Pub Date : 2015-09-25 DOI:10.4230/LIPIcs.SWAT.2016.30

B. Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen

{"title":"简单多边形三角化的时空权衡","authors":"B. Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen","doi":"10.4230/LIPIcs.SWAT.2016.30","DOIUrl":null,"url":null,"abstract":"An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s up to n. The algorithm runs in O(n^2/s+n(log s)log^5(n/s)) expected time using O(s) variables, for any s up to n. In particular, the algorithm runs in O(n^2/s) expected time for most values of s.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"10 1","pages":"105-124"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Time-Space Trade-offs for Triangulating a Simple Polygon\",\"authors\":\"B. Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen\",\"doi\":\"10.4230/LIPIcs.SWAT.2016.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s up to n. The algorithm runs in O(n^2/s+n(log s)log^5(n/s)) expected time using O(s) variables, for any s up to n. In particular, the algorithm runs in O(n^2/s) expected time for most values of s.\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"10 1\",\"pages\":\"105-124\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.SWAT.2016.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.SWAT.2016.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 10

摘要

s-workspace算法是一种算法，它对输入的值具有只读访问权限，对输出具有只写访问权限，并且只使用O(s)个额外的空间字。我们给出了一个随机s-工作空间算法，用于三角化一个简单的多边形P (n个顶点)，对于任何s到n。该算法运行在O(s)个变量的O(n^2/s+n(log s)log^5(n/s))期望时间内，对于任何s到n。特别是，该算法运行在O(n^2/s)期望时间内对于大多数s值。

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

查看原文本刊更多论文

Time-Space Trade-offs for Triangulating a Simple Polygon

An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s up to n. The algorithm runs in O(n^2/s+n(log s)log^5(n/s)) expected time using O(s) variables, for any s up to n. In particular, the algorithm runs in O(n^2/s) expected time for most values of s.

求助全文

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

来源期刊

International Journal of Computational Geometry & Applications 数学-计算机：理论方法

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.