Computing a visibility polygon using few variables

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 ou...

Full description

Bibliographic Details
Main Author: Barba, Luis (author)
Other Authors: Korman, Matias (author), Langerman, Stefan (author), Silveira, Rodrigo (author)
Format: article
Language:eng
Published: 2018
Subjects:
Computational geometry
Memory-constrained algorithms
Time-space-trade-off visibility
Simple polygon
Online Access:http://hdl.handle.net/10773/21926
Country:Portugal
Oai:oai:ria.ua.pt:10773/21926

Internet

http://hdl.handle.net/10773/21926

Similar Items