Decomposition of multiple coverings into more parts
type: Item
instance of: scholarly article
title: Decomposition of multiple coverings into more parts
zbMATH Open document ID: 1206.52013
author: Greg Aloupis
author: Jean Cardinal
author: Sébastien Collette
author: Stefan Langerman
author: David Orden
author: Pedro Ramos
published in: Discrete \& Computational Geometry
publication date: 2010-11-08T00:00:00Z
review text: The authors prove that for every centrally symmetric convex polygon \(Q\), there exists a constant \(\alpha\) such that any locally finite \(\alpha k\)-fold covering of the plane by translates of \(Q\) can be decomposed into \(k\) coverings.
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 5813745
zbMATH Keywords: cover decomposition
zbMATH Keywords: geometric hypergraphs
zbMATH Keywords: centrally symmetric polygons
reviewed by: Yurii G. Nikonorov
MaRDI profile type: Publication
full work available at URL: s00454-009-9238-3
OpenAlex ID: W2143341942
cites work: ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
cites work: Coloring Geometric Range Spaces
cites work: Research Problems in Discrete Geometry
cites work: Q2934699
cites work: On splitting infinite-fold covers
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Decomposing Coverings and the Planar Sensor Cover Problem
cites work: Q3886431
cites work: Covering the plane with convex polygons
cites work: Indecomposable Coverings
cites work: Decomposition of multiple coverings into many parts
cites work: Indecomposable coverings with concave polygons
cites work: Convex polygons are cover-decomposable
cites work: Multiple coverings of the plane with triangles
DOI: 10.1007/S00454-009-9238-3
description: scientific article; zbMATH DE number 5813745