par Barba Flores, Luis 
;Korman, Matias ;Langerman, Stefan ;Silveira, Rodrigo R.I.
Référence Computational geometry, 47, 9, page (918-926)
Publication Publié, 2014-10
;Korman, Matias ;Langerman, Stefan ;Silveira, Rodrigo R.I.Référence Computational geometry, 47, 9, page (918-926)
Publication Publié, 2014-10
Article révisé par les pairs
| Résumé : | 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. © 2014 Elsevier B.V. |
