Indecomposable coverings with concave polygons

DOI10.1007/S00454-009-9194-YzbMATH Open1211.52017OpenAlexW1982498410MaRDI QIDQ603839FDOQ603839

Authors: 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

Recommendations

• Indecomposable coverings with homothetic polygons
• Convex polygons are cover-decomposable
• Decomposition of multiple coverings into more parts
• Multiple coverings of the plane with triangles
• Multiple coverings with closed polygons

zbMATH Keywords

sensor networksmultiple coverings

Mathematics Subject Classification ID

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

Cites Work

• Covering the plane with convex polygons
• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposing coverings and the planar sensor cover problem
• Indecomposable Coverings
• Decomposition of multiple coverings into more parts
• On splitting infinite-fold covers

Cited In (23)

• Coloring Delaunay-edges and their generalizations
• Polychromatic coloring for half-planes
• Proper coloring of geometric hypergraphs
• Title not available (Why is that?)
• An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
• The determinant bound for discrepancy is almost tight
• Multiple coverings with closed polygons
• Semidefinite optimization in discrepancy theory
• Octants are cover-decomposable
• Decomposition of multiple coverings into more parts
• Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs
• Optimally decomposing coverings with translates of a convex polygon
• Coloring points with respect to squares
• Convex polygons are self-coverable
• Indecomposable Coverings
• Title not available (Why is that?)
• Algorithmic aspects of combinatorial discrepancy
• On the gap between hereditary discrepancy and the determinant lower bound
• Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
• Indecomposable coverings with homothetic polygons
• Indecomposable Coverings
• Convex polygons are cover-decomposable
• Octants are cover-decomposable into many coverings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603839)