Convex Polygons are Self-Coverable
Metric Geometry
2014-03-17 v2 Computational Geometry
Discrete Mathematics
Combinatorics
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.
Keywords
Cite
@article{arxiv.1307.2411,
title = {Convex Polygons are Self-Coverable},
author = {Balázs Keszegh and Dömötör Pálvölgyi},
journal= {arXiv preprint arXiv:1307.2411},
year = {2014}
}