Guarding polyominoes, polycubes and polyhypercubes

DOI10.1016/J.ENDM.2015.06.024MaRDI QIDQ322213zbMATH OpenOpenAlexFDO

Authors Val Pinciu

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.024

zbMATH Keywords

art gallery theorempolyominopolycubepolyhypercube

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Polyominoes (05B50)

Recommendations

• Guarding polyominoes
• The art gallery theorem for polyominoes
• Guards, Galleries, Fortresses, and the Octoplex
• scientific article; zbMATH DE number 2163102
• COMPUTATIONAL GEOMETRY COLUMN 15

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• Perfect graphs and guarding rectilinear art galleries
• Relations between packing and covering numbers of a tree
• The art gallery theorem for polyominoes

Cited in

(4)

• Guarding polyominoes
• Art gallery problem with rook and queen vision
• The art gallery theorem for polyominoes
• Guarding polyominoes under \(k\)-hop visibility

This page was built for publication: Guarding polyominoes, polycubes and polyhypercubes

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