Guarding and Searching Polyhedra

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.

Ph.D. thesis

Cited by in corpus (1)

• Partitioning Strategies and Task Allocation for Target-tracking with Multiple Guards in Polygonal Environments