White Space Regions
We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white).
The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points.
In other words, these convex hulls make it safe for white antennas to communicate with each other without any interference
with black antennas. We study the problem on three different settings (based on overlapping between different convex hulls)
and find hardness results and good approximation algorithms.