A constant-factor approximation algorithm for vertex guarding a WV-polygon

DOI10.20382/JOCG.V12I1A6MaRDI QIDQ5075347zbMATH OpenFDO

Authors Stav Ashur, Omrit Filtser, Matthew J. Katz

Publication date 13 May 2022

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Vertex guarding in weak visibility polygons
• Approximability of guarding weak visibility polygons
• Fast vertex guarding for polygons with and without holes
• Approximate guarding of monotone and rectilinear polygons
• Automata, Languages and Programming

Cited in

(3)

• Reflective guarding a gallery
• Fast vertex guarding for polygons with and without holes
• Vertex guarding in weak visibility polygons

This page was built for publication: A constant-factor approximation algorithm for vertex guarding a WV-polygon

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