Geometric Multi-Covering

In this paper we present a general, unified framework to resolve geometric covering problems. The problem is reduced to a set cover search in parametric space. We propose and implement different methods for solving the set cover problem, allowing for flexible trade-offs between solution quality and computation time. Our framework relies on computer graphics techniques and heavily exploits GPU based computations. Results are demonstrated in two specific applications: firstly, multi-visibility/accessibility analysis of 3D scenes that guarantees coverage, possibly redundant, of the target shape(s) by a minimal number of observers. Secondly, illumination design in 3D environments that ensures the satisfaction of local constraints on illuminance levels using a minimal set of lamps.

BibTeX Entry:

@inproceedings{cad/graphics-2013,
      author = "Rouven Strauss and Florin Isvoranu
               and Gershon Elber",
      title = "Geometric Multi-Covering", 
      booktitle = "CAD/Graphics 2013 Conference Proceedings",
      year = "2013",
}

Online version of article:
Geometric Multi-Covering