Indecomposable coverings with concave polygons

DOI10.1007/s00454-009-9194-yzbMath1211.52017OpenAlexW1982498410MaRDI QIDQ603839

Dömötör Pálvölgyi

Publication date: 8 November 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9194-y

zbMATH Keywords

sensor networksmultiple coverings

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (18)

Convex polygons are cover-decomposable ⋮ Unsplittable coverings in the plane ⋮ Decomposition of multiple coverings into more parts ⋮ Coloring points with respect to squares ⋮ Octants are cover-decomposable ⋮ Optimally decomposing coverings with translates of a convex polygon ⋮ Unnamed Item ⋮ Polychromatic coloring for half-planes ⋮ Octants are cover-decomposable into many coverings ⋮ Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs ⋮ Coloring Delaunay-edges and their generalizations ⋮ The determinant bound for discrepancy is almost tight ⋮ Multiple coverings with closed polygons ⋮ Semidefinite optimization in discrepancy theory ⋮ An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes ⋮ Proper coloring of geometric hypergraphs ⋮ Algorithmic Aspects of Combinatorial Discrepancy ⋮ Indecomposable coverings with homothetic polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering the plane with convex polygons
• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• On splitting infinite-fold covers
• Decomposing Coverings and the Planar Sensor Cover Problem
• Indecomposable Coverings

This page was built for publication: Indecomposable coverings with concave polygons