Computing the Visibility Polygon Using Few Variables

DOI10.1007/978-3-642-25591-5_9zbMath1350.68257arXiv1111.3584OpenAlexW1593130392MaRDI QIDQ3104601

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

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3584

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Memory-constrained algorithms for simple polygons ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ Computing a visibility polygon using few variables ⋮ A space-time trade-off for computing the visibility polygon in the multi-pass model

This page was built for publication: Computing the Visibility Polygon Using Few Variables