Abstract
Let X be a simple region (e.g., a simple polygon), and let Q be a set of points in X. Let O be a convex object, such as a disk, a square, or an equilateral triangle. We present a scheme for computing a minimum cover of Q, consisting of homothets of O contained in X. In particular, a minimum disk cover of Q with respect to X, can be computed in polynomial time.
Original language | American English |
---|---|
Pages (from-to) | 349-360 |
Number of pages | 12 |
Journal | Algorithmica |
Volume | 62 |
Issue number | 1-2 |
DOIs | |
State | Published - 1 Feb 2012 |
Keywords
- Chordal graphs
- Covering
- Geometric optimization
All Science Journal Classification (ASJC) codes
- General Computer Science
- Applied Mathematics
- Computer Science Applications