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)
This talk describes three different kinds of data that algorithm designers use to test their implementations. Selecting input data for past problems typically involves scholarship to assemble existing data and ingenuity to model it efficiently. Selecting data for present problems should be based on active discussions with users and careful study of existing(More)
  • 1