Multiple Coverings of the Plane with Triangles

Authors:
Gabor Tardos;Geza Toth
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6;Renyi Institute of Mathematics, Hungarian Academy of Sciences, Pf. 127, H-1364 Budapest, Hungary
Venue:
Discrete & Computational Geometry
Year:
2007

Decomposition of multiple coverings into many parts

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Decomposition of multiple coverings into many parts

Computational Geometry: Theory and Applications
Coloring Axis-Parallel Rectangles

Computational Geometry and Graph Theory
Decomposition of multiple coverings into more parts

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Indecomposable coverings

CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Notes: Coloring axis-parallel rectangles

Journal of Combinatorial Theory Series A
Polychromatic coloring for half-planes

Journal of Combinatorial Theory Series A
Colorful strips

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Polychromatic coloring for half-planes

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Octants are cover-decomposable into many coverings

Computational Geometry: Theory and Applications

Hi-index	0.00

We prove that any 43-fold covering of the plane with translates of a triangle can be decomposed into two coverings.