Convex polygons are cover-decomposable

DOI10.1007/s00454-009-9133-yzbMath1194.52017OpenAlexW2129478088MaRDI QIDQ2380774

Dömötör Pálvölgyi, Géza Tóth

Publication date: 12 April 2010

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

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

zbMATH Keywords

polygondecomposabilitymultiple coveringwedgescoverig

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items

Unsplittable coverings in the plane ⋮ Indecomposable coverings with concave polygons ⋮ Decomposition of multiple coverings into more parts ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Coloring points with respect to squares ⋮ Colouring bottomless rectangles and arborescences ⋮ Octants are cover-decomposable ⋮ Optimally decomposing coverings with translates of a convex polygon ⋮ Polychromatic coloring for half-planes ⋮ Octants are cover-decomposable into many coverings ⋮ Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs ⋮ Multiple coverings with closed polygons ⋮ An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes ⋮ Proper coloring of geometric hypergraphs ⋮ Indecomposable coverings with homothetic polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Indecomposable coverings with concave polygons
• Decomposition of multiple coverings into many parts
• Covering the plane with convex polygons
• Multiple coverings of the plane with triangles
• Research Problems in Discrete Geometry
• Indecomposable Coverings

This page was built for publication: Convex polygons are cover-decomposable