Time-space trade-offs for triangulations and Voronoi diagrams

Matias Korman, Wolfgang Mulzer, André Van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein

研究成果: Conference contribution

6 被引用数 (Scopus)

抄録

Let S be a planar n-point set. A triangulation for S is a maximal plane straight-line graph with vertex set S. The Voronoi diagram for S is the subdivision of the plane into cells such that each cell has the same nearest neighbors in S. Classically, both structures can be computed in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: given a parameter s ∈ {1,..., n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and writing intermediate data. The output should then be written to a write-only structure. We describe a deterministic s-workspace algorithm for computing a triangulation of S in time O(n2/s + n log n log s) and a randomized s-workspace algorithm for finding the Voronoi diagram of S in expected time O((n2/s) log s + n log s log s).

本文言語English
ホスト出版物のタイトルAlgorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings
編集者Frank Dehne, Jorg-Rudiger Sack, Ulrike Stege
出版社Springer Verlag
ページ482-494
ページ数13
ISBN(印刷版)9783319218397
DOI
出版ステータスPublished - 2015
イベント14th International Symposium on Algorithms and Data Structures, WADS 2015 - Victoria, Canada
継続期間: 2015 8月 52015 8月 7

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9214
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other14th International Symposium on Algorithms and Data Structures, WADS 2015
国/地域Canada
CityVictoria
Period15/8/515/8/7

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Time-space trade-offs for triangulations and Voronoi diagrams」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル