Making Octants Colorful and Related Covering Decomposition Problems

Abstract : We give new positive results on the long-standing open problem of geometric covering decomposition for homo-thetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R 3 can be colored with k colors so that every translate of the negative octant containing at least k 6 points contains at least one of each color. The best previously known bound was doubly exponential in k. This yields, among other corollaries, the first polynomial bound for the de-composability of multiple coverings by homothetic triangles. We also investigate related decomposition problems involving intervals appearing on a line. We prove that no algorithm can dynamically maintain a decomposition of a multiple covering by intervals under insertion of new intervals, even in a semi-online model, in which some coloring decisions can be delayed. This implies that a wide range of sweeping plane algorithms cannot guarantee any bound even for special cases of the octant problem.
Document type :
Conference papers
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01457914
Contributor : Kolja Knauer <>
Submitted on : Monday, February 6, 2017 - 4:00:32 PM
Last modification on : Saturday, August 24, 2019 - 1:17:01 AM
Long-term archiving on : Sunday, May 7, 2017 - 2:34:46 PM

File

octants.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01457914, version 1

Collections

Citation

Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt. Making Octants Colorful and Related Covering Decomposition Problems. SODA 2014, Jan 2014, Portland, United States. ⟨hal-01457914⟩

Share

Metrics

Record views

332

Files downloads

107