Guarding and Searching Polyhedra
classification
💻 cs.CG
cs.CC
keywords
polyhedraproblemdimensionaledgeemphasisenvironmentsgalleryguarding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.