Convex Polygons are Cover-Decomposable

Authors:
Dömötör Pálvölgyi;Géza Tóth
Affiliations:
ELTE, Budapest, Hungary and EPFL, Lausanne, Switzerland;Hungarian Academy of Sciences, Rényi Institute, Budapest, Hungary
Venue:
Discrete & Computational Geometry
Year:
2010

Citing 0
Cited 4

Polychromatic coloring for half-planes

Journal of Combinatorial Theory Series A
Polychromatic coloring for half-planes

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Octants are cover-decomposable into many coverings

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for any open convex polygon P, there is a constant k(P) such that any k(P)-fold covering of the plane with translates of P can be decomposed into two coverings.