Undine Leopold

Learn More
We show it is NP-hard to compute a minimum cover of point 2-transmitters, point k-transmitters and edge 2-transmitters in a simple polygon; the point 2-transmitter result extends to orthogonal polygons. Introduction. The traditional art gallery problem (AGP) considers placing guards in an art gallery—modeled by a polygon—such that every point in the room(More)
We consider a generalization of the classical Art Gallery Problem, where instead of a light source, the guards, called k-transmitters, model a wireless device with a signal that can pass through at most k walls. We show it is NP-hard to compute a minimum cover of point 2-transmitters, point k-transmitters, and edge 2-transmitters in a simple polygon. The(More)
  • 1