TY - GEN

T1 - A scheme for computing minimum covers within simple regions

AU - Katz, Matthew J.

AU - Morgenstern, Gila

PY - 2009/9/14

Y1 - 2009/9/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=69949127437&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03367-4_39

DO - 10.1007/978-3-642-03367-4_39

M3 - Conference contribution

AN - SCOPUS:69949127437

SN - 3642033660

SN - 9783642033667

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 447

EP - 458

BT - Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings

T2 - 11th International Symposium on Algorithms and Data Structures, WADS 2009

Y2 - 21 August 2009 through 23 August 2009

ER -