Searching Polyhedra by rotating half-Planes

  title={Searching Polyhedra by rotating half-Planes},
  author={Giovanni Viglietta},
  journal={Int. J. Comput. Geometry Appl.},
The Searchlight Scheduling Problem was first studied in 2D polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3D polyhedra, with the guards now boundary segments who rotate half-planes of illumination. After carefully detailing the 3D model, several results are… CONTINUE READING