On vertex guarding staircase polygons

DOI10.1007/978-3-031-20624-5_45MaRDI QIDQ6164013zbMATH OpenOpenAlexFDO

Authors Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Paweł Żyliński

Publication date 26 July 2023

Published in LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20624-5_45

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• An approximation algorithm for the art gallery problem
• Approximate guarding of monotone and rectilinear polygons
• Computational complexity of art gallery problems
• Guarding terrains via local search
• On vertex guarding staircase polygons
• Terrain guarding is NP-hard

Cited in

(4)

• Guarding disjoint triangles and claws in the plane
• scientific article; zbMATH DE number 7399675 (Why is no real title available?)
• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• On vertex guarding staircase polygons

This page was built for publication: On vertex guarding staircase polygons

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