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.
Recommendations
Cites work
- Concrete and abstract Voronoi diagrams
- Deciding soccer scores and partial orientations of graphs
- Indecomposable coverings with homothetic polygons
- Making Octants Colorful and Related Covering Decomposition Problems
- Making triangles colorful
- Octants are cover-decomposable
- Octants are cover-decomposable into many coverings
- Survey on decomposition of multiple coverings
Cited in
(6)- Coloring Delaunay-edges and their generalizations
- Proper coloring of geometric hypergraphs
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Coloring points with respect to squares
- Selfishness of convex bodies and discrete point sets
- Indecomposable coverings with homothetic polygons
This page was built for publication: Convex polygons are self-coverable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741609)
