Variants of Visibility and their Complexity

DOI10.1002/MALQ.19980440411MaRDI QIDQ4224086zbMATH OpenOpenAlexFDO

Authors Dietmar Schuchardt, Hans-Dietrich Hecker

Publication date 28 June 1999

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

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

zbMATH Keywords

NP-hardvisibility

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1161868
• COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
• THE VISIBILITY COMPLEX
• The visibility function revisited
• Visibility optimization using variational approaches
• On the complexity of visibility problems with moving viewpoints
• Visibility in changeable sets
• The visibility-Voronoi complex and its applications
• The visibility-Voronoi complex and its applications
• Visibility in semi-convex spaces

Cited in

(6)

• Hiding people in polygons
• Computational complexity of the r-visibility guard set problem for polyominoes
• scientific article; zbMATH DE number 1161868 (Why is no real title available?)
• On the complexity of visibility problems with moving viewpoints
• scientific article; zbMATH DE number 5268909 (Why is no real title available?)
• A more compact visibility representation

This page was built for publication: Variants of Visibility and their Complexity

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