Topics
polygonPerson
We prove that for any polygon S with at least four sides, and any k> 0, there is a k-fold covering of the plane with homothetic copies of S that can not be decomposed into two coverings.
We introduce a new notion for geometric families called self-coverability and show that homothets of...
This text is concerned with the construction of fundamental polygons for coverings of finite multipl...
The study of multiple coverings was initiated by Davenport and L. Fejes Tóth more than 50 years ago....
A planar set P is said to be cover-decomposable if there is a constant k = k(P) such that every k-fo...
We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold cov...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
We shall show that every planar 4-fold covering of K_<3,3> can be decomposed into two planar 2-fold ...
We study two decomposition problems in combinatorial geometry. The rst part of the thesis deals with...
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an ...
AbstractLet m(k) denote the smallest positive integer m such that any m-fold covering of the plane w...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
Abstract. We give new positive results on the long-standing open problem of geometric covering decom...
Abstract. A graph G has a planar cover if there exists a planar graph H, and a homo-morphism ' ...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...
We introduce a new notion for geometric families called self-coverability and show that homothets of...
This text is concerned with the construction of fundamental polygons for coverings of finite multipl...
The study of multiple coverings was initiated by Davenport and L. Fejes Tóth more than 50 years ago....
A planar set P is said to be cover-decomposable if there is a constant k = k(P) such that every k-fo...
We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold cov...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
We shall show that every planar 4-fold covering of K_<3,3> can be decomposed into two planar 2-fold ...
We study two decomposition problems in combinatorial geometry. The rst part of the thesis deals with...
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an ...
AbstractLet m(k) denote the smallest positive integer m such that any m-fold covering of the plane w...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
Abstract. We give new positive results on the long-standing open problem of geometric covering decom...
Abstract. A graph G has a planar cover if there exists a planar graph H, and a homo-morphism ' ...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...
We introduce a new notion for geometric families called self-coverability and show that homothets of...
This text is concerned with the construction of fundamental polygons for coverings of finite multipl...
The study of multiple coverings was initiated by Davenport and L. Fejes Tóth more than 50 years ago....
Add to ORKG