Time-space trade-offs for triangulating a simple polygon

Boris Aronov, Matias Korman, Simon Pratt, André Van Renssen, Marcel Roeloffzen

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

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 ∈ O(n). The algorithm runs in O(n2/s + n(log s) log5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n/log n log5 log n) algorithm runs in O(n2/s) expected time.

本文言語English
ホスト出版物のタイトル15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
編集者Rasmus Pagh
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ30.1-30.12
ISBN(電子版)9783959770118
DOI
出版ステータスPublished - 2016 6 1
イベント15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016 - Reykjavik, Iceland
継続期間: 2016 6 222016 6 24

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
53
ISSN(印刷版)1868-8969

Other

Other15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
国/地域Iceland
CityReykjavik
Period16/6/2216/6/24

ASJC Scopus subject areas

  • ソフトウェア

引用スタイル