Geometric multi-covering

Geometric multi-covering

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 ti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & graphics 2014-02, Vol.38, p.222-229
Hauptverfasser: Strauss, Rouven, Isvoranu, Florin, Elber, Gershon
Format: Artikel
Sprache:eng
Schlagworte:
Computation
Computer graphics
Covering
Mathematical models
Searching
Tradeoffs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0097-8493
DOI:10.1016/j.cag.2013.10.018