Keszegh, Balázs and Pálvölgyi, Dömötör (2014) Octants are Cover Decomposable into Many Coverings. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 47 (5). pp. 585-588. ISSN 0925-7721
|
Text
1207.0672.pdf Available under License Creative Commons Attribution. Download (146kB) | Preview |
Official URL: https://doi.org/10.1016/j.comgeo.2013.12.001
Abstract
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into k coverings. As a corollary, we obtain that any m(k)-fold covering of any subset of the plane with a finite number of homothetic copies of a given triangle can be decomposed into k coverings. Previously only some weaker bounds were known for related problems.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Applications; Computational geometry; Hypergraph coloring; Finite number; Geometric hypergraph coloring; Cover-decomposition; |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 07 Feb 2024 15:09 |
Last Modified: | 07 Feb 2024 15:09 |
URI: | http://real.mtak.hu/id/eprint/187808 |
Actions (login required)
![]() |
Edit Item |