A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering
Karen Daniels, Arti Mathur, Roger B. Grinde · Canadian Conference on Computational Geometry · 2003
The goal of this research is to provide practical solutions for covering problems. Covering problems arise in a variety of practical settings such as manufacturing, telecommunications, spatial query optimization, publish/subscribe middleware, graphics, molecular modeling, medical treatment and mobile military sensor coverage and targeting. For example, in the mobile sensor case a region is associated with each sensor representing the extent of its coverage. The goal is to find placements of the sensors so that, together, they cover a collection of target regions. This section specifies the covering problem addressed here, surveys related work and gives an overview of the remainder of the paper.