Orthogonal Terrain Guarding is NP-complete

DOI10.20382/jocg.v10i2a3zbMath1494.68269OpenAlexW2970343152MaRDI QIDQ5207871

Édouard Bonnet, Panos Giannopoulos

Publication date: 13 January 2020

Full work available at URL: https://jocg.org/index.php/jocg/article/download/3086/2813

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ The dispersive art gallery problem ⋮ On the complexity of half-guarding monotone polygons ⋮ Clique-width of point configurations ⋮ Parameter analysis for guarding terrains

This page was built for publication: Orthogonal Terrain Guarding is NP-complete