Covering the Plane with Convex Polygons
نویسنده
چکیده
It is proved that for any centrally symmetric convex polygonal domain P and for any natural number r, there exists a constant k = k(P, r) such that any k-fold covering of the plane with translates of P can be split into r simple coverings.
منابع مشابه
Multiple Coverings with Closed Polygons
A planar set P is said to be cover-decomposable if there is a constant k = k(P ) such that every k-fold covering of the plane with translates of P can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane wi...
متن کاملDecomposition of Geometric Set Systems and Graphs
We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold covering of the plane with its translates is decomposable into two disjoint coverings of the whole plane. Pach conjectured that every convex set is...
متن کاملOn the structure of multi
We consider polygons with the following \pairing property": for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon K tiles the plane multiply when translated at the locations , where is a multiset in the plane. The pairing property of K makes this question particularly amenable to Fourier Analysis. After establishing a necessar...
متن کامل1 4 A pr 1 99 9 On the structure of multi PREPRINT ple translational tilings by polygonal regions
We consider polygons with the following “pairing property”: for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon K tiles the plane multiply when translated at the locations Λ, where Λ is a multiset in the plane. The pairing property of K makes this question particularly amenable to Fourier Analysis. After establishing a neces...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 1 شماره
صفحات -
تاریخ انتشار 1986