Name
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 with respect to X, consisting of homothetic copies of O. In particular, a minimum disk cover of Q with respect to X, can be computed in polynomial time.
|
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00453-010-9458-1 | workshop on algorithms and data structures |
Keywords | Field | DocType |
Geometric optimization,Covering,Chordal graphs | Discrete mathematics,Equilateral triangle,Combinatorics,Regular polygon,Simple polygon,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
62 | 1-2 | 0178-4617 |
Citations | PageRank | References |
2 | 0.37 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew J. Katz | 1 | 225 | 19.92 |
| Gila Morgenstern | 2 | 63 | 7.37 |