Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem

DOI10.1016/J.COMGEO.2016.07.003zbMath1354.65036arXiv1509.05227OpenAlexW3102203100MaRDI QIDQ340521

Tamás Róbert Mezei, Ervin Gyoeri

Publication date: 14 November 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05227

zbMATH Keywords

art gallerymobile guardpolyomino partition

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Mobile versus point guards

Cites Work

• Unnamed Item
• Unnamed Item
• Triangulating a simple polygon in linear time
• Generalized guarding and partitioning for rectilinear polygons
• Traditional Galleries Require Fewer Watchmen
• A Short Proof of the Rectilinear Art Gallery Theorem

This page was built for publication: Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem