I and my coauthors have a new paper on arXiv (well, only a week old): Guard Placement For Wireless Localization, with Mike Goodrich and Nodari Sitchinava.

The basic problem is to place as few wedges as possible in the plane such that a desired polygon can be formed as some monotone Boolean combination of the wedges. The motivation is for wireless devices to prove that they are located within a target area by their ability to communicate with a subset of base stations (the wedges), though there's still something of a gap between the theoretical problem and the application (radio isn't limited to wedges very easily, and infrared gets stopped by walls). Regardless, it leads to interesting combinatorial geometry questions. We provide definitive answers to some of them (convex polygons require exactly \( \lceil n/2 \rceil \) wedges; the minimum number of wedges any polygon can require is \( \Theta(\sqrt{n}) \)) but many remain open.