scientific article; zbMATH DE number 3872705

MaRDI QIDQ3339306zbMATH OpenFDO

Authors Christos Levcopoulos, Andrzej Lingas

Publication date 1984

zbMATH Keywords

convex polygonslower boundrectangular coveringsimple polygonsupper bound

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 3893101
• scientific article; zbMATH DE number 4049039
• Close approximations of minimum rectangular coverings
• scientific article; zbMATH DE number 5291457
• scientific article; zbMATH DE number 3918386

Cited in

(15)

• Covering simply connected regions by rectangles
• Close approximations of minimum rectangular coverings
• Approximate guarding of monotone and rectilinear polygons
• Covering points with minimum/maximum area orthogonally convex polygons
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• scientific article; zbMATH DE number 5369649 (Why is no real title available?)
• scientific article; zbMATH DE number 3918386 (Why is no real title available?)
• An algorithm for covering polygons with rectangles
• scientific article; zbMATH DE number 4049039 (Why is no real title available?)
• scientific article; zbMATH DE number 29609 (Why is no real title available?)
• scientific article; zbMATH DE number 1076151 (Why is no real title available?)
• scientific article; zbMATH DE number 4121435 (Why is no real title available?)
• scientific article; zbMATH DE number 3893101 (Why is no real title available?)
• scientific article; zbMATH DE number 5025945 (Why is no real title available?)
• Close approximations of minimum rectangular coverings (extended abstract)

This page was built for publication:

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