Convex Polygons are Self-Coverable
Authors:
- Balázs KeszeghBKBalázs Keszegh
- Dömötör PálvölgyiDPDömötör Pálvölgyi
Preprint
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
All Related Versions
This publication has 3 references indexed in Scilit:
- Survey on Decomposition of Multiple Coverings2013
- Octants Are Cover-DecomposableDiscrete & Computational Geometry, 2011
- Decomposition of Geometric Set Systems and Graphs