Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons

DOI10.1002/MALQ.19950410212MaRDI QIDQ4835529zbMATH OpenOpenAlexFDO

Authors Dietmar Schuchardt, Hans-Dietrich Hecker

Publication date 17 December 1995

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19950410212

zbMATH Keywords

visibilityart-gallery problemscomplexity of geometric problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• Computational complexity of art gallery problems

Cited in

(31)

• Clearing an orthogonal polygon to find the evaders
• An exact algorithm for minimizing vertex guards on art galleries
• On guarding orthogonal polygons with sliding cameras
• How to guard orthogonal polygons: diagonal graphs and vertex covers
• Guarding orthogonal art galleries with sliding cameras
• Approximation algorithms for art gallery problems in polygons
• Approximability of guarding weak visibility polygons
• Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
• Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
• Art Gallery Problems for Convex Nested Polygons
• Computational complexity of the \(r\)-visibility guard set problem for polyominoes
• On \(r\)-guarding SCOTs -- a new family of orthogonal polygons
• Vertex guarding for dynamic orthogonal art galleries
• A practical algorithm with performance guarantees for the art gallery problem
• On boundaries of highly visible spaces and applications
• Guarding monotone art galleries with sliding cameras in linear time
• Guarding orthogonal art galleries with sliding cameras
• Constrained light deployment for reducing energy consumption in buildings
• Vertex-to-point conflict-free chromatic guarding is NP-hard
• Polygon exploration with time-discrete vision
• The parameterized complexity of guarding almost convex polygons
• On orthogonally guarding orthogonal polygons with bounded treewidth
• On guarding the vertices of rectilinear domains
• The art gallery theorem for polyominoes
• Topological art in simple galleries
• The dispersive art gallery problem
• Parameterized Analysis of Art Gallery and Terrain Guarding
• Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
• Covering orthogonal polygons with sliding \(k\)-transmitters
• Finding minimum witness sets in orthogonal polygons
• Mobile versus point guards

This page was built for publication: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons

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