English

Guarding and Searching Polyhedra

Computational Geometry 2012-11-13 v1 Computational Complexity

Abstract

We tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and orthogonal polyhedra.

Keywords

Cite

@article{arxiv.1211.2483,
  title  = {Guarding and Searching Polyhedra},
  author = {Giovanni Viglietta},
  journal= {arXiv preprint arXiv:1211.2483},
  year   = {2012}
}

Comments

Ph.D. thesis

R2 v1 2026-06-21T22:36:30.446Z