Convex Polygons are Self-Coverable

Keszegh, Balázs and Pálvölgyi, Dömötör (2014) Convex Polygons are Self-Coverable. Discrete & Computational Geometry, 51 (4). pp. 885-895. ISSN 0179-5376

	Text self-cover_rev03.pdf - Published Version Restricted to Registered users only Download (249kB)
Preview	Text self-cover.pdf - Accepted Version Download (248kB) | Preview

Abstract

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family with many points contains all colors. This is dual (and in some cases equivalent) to the much investigated cover-decomposability problem.

Actions (login required)

Edit Item