Computing a visibility polygon using few variables

Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira

研究成果: Article査読

16 被引用数 (Scopus)

抄録

We present several algorithms for computing the visibility polygon of a simple polygon P of n vertices (out of which r are reflex) from a viewpoint inside P, when P resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in O(nr̄) time, where r̄ denotes the number of reflex vertices of P that are part of the output. Whenever we are allowed to use O(s) variables, the running time decreases to O(nr2 s+nlog2r) (or O(nr2s+nlogr) randomized expected time), where s∈O(logr). This is the first algorithm in which an exponential space-time trade-off for a geometric problem is obtained.

本文言語English
ページ(範囲)918-926
ページ数9
ジャーナルComputational Geometry: Theory and Applications
47
9
DOI
出版ステータスPublished - 2014 10
外部発表はい

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

フィンガープリント 「Computing a visibility polygon using few variables」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル