\(K\)-vertex guarding simple polygons

DOI10.1016/j.comgeo.2008.07.004zbMath1158.52008OpenAlexW1972421563MaRDI QIDQ1005333

Ihsan Salleh

Publication date: 9 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.07.004

zbMATH Keywords

algorithmscomputational geometryart galleryvertex guards

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (3)

Note on the paper ``K-vertex guarding simple polygons ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries

Cites Work

• Unnamed Item

This page was built for publication: \(K\)-vertex guarding simple polygons