Art gallery theorems and algorithms
Art gallery theorems and algorithms
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Planning for complete sensor coverage in inspection
Computer Vision and Image Understanding
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Approximating geometric coverage problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Automatic sensor placement in a 3D volume
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
A local/global approach to mesh parameterization
SGP '08 Proceedings of the Symposium on Geometry Processing
Almost Isometric Mesh Parameterization through Abstract Domains
IEEE Transactions on Visualization and Computer Graphics
Coverage-Aware sensor engagement in dense sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Computer-Aided Design
| Hi-index | 0.00 |
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.