Convex polygons are cover-decomposable
Pálvölgyi, D.; Tóth, G.
2010

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.

Details

Title Convex polygons are cover-decomposable
Author(s) Pálvölgyi, D. ; Tóth, G.
Published in Discrete and Computational Geometry
Volume 43
Issue 3
Pages 483-496
Date 2010
Keywords
DOI https://doi.org/10.1007/s00454-009-9133-y
Other identifier(s) View record in Web of Science
Laboratories DCG
Record Appears in Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date 2010-11-26

Actions