On vertex guarding staircase polygons

DOI10.1007/978-3-031-20624-5_45OpenAlexW4312696641MaRDI QIDQ6164013FDOQ6164013

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

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

Cites Work

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

Cited In (4)

• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• Title not available (Why is that?)
• Guarding disjoint triangles and claws in the plane
• 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)