A combinatorial maximum cover approach to 2D translational geometric covering

@inproceedings{Daniels2003ACM,
  title={A combinatorial maximum cover approach to 2D translational geometric covering},
  author={Karen Daniels and Arti Mathur and Roger Grinde},
  booktitle={CCCG},
  year={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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

An incremental algorithm for translational polygon covering

  • K. Daniels, R. Inkulu
  • Technical report, Dept. of Computer Science,
  • 2001

Solving an apparel trim placement problem using a maximum cover problem approach

  • R. Grinde, K. Daniels
  • Institute of Industrial Engineers (IIE…
  • 1999

Similar Papers

Loading similar papers…