Indecomposable coverings with concave polygons

DOI10.1007/S00454-009-9194-YMaRDI QIDQ603839zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 6381738 (Why is no real title available?)
• scientific article; zbMATH DE number 3692179 (Why is no real title available?)
• Convex polygons are cover-decomposable
• Covering the plane with convex polygons
• Decomposing coverings and the planar sensor cover problem
• Decomposition of multiple coverings into more parts
• Indecomposable Coverings
• Multiple coverings of the plane with triangles
• On splitting infinite-fold covers

Cited in

(23)

• Coloring Delaunay-edges and their generalizations
• Polychromatic coloring for half-planes
• Proper coloring of geometric hypergraphs
• scientific article; zbMATH DE number 3893922 (Why is no real title available?)
• 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
• Optimally decomposing coverings with translates of a convex polygon
• Convex polygons are self-coverable
• Coloring points with respect to squares
• Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs
• Indecomposable Coverings
• scientific article; zbMATH DE number 7758358 (Why is no real title available?)
• 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
• Convex polygons are cover-decomposable
• Indecomposable Coverings
• 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)