Variants of Visibility and their Complexity

DOI10.1002/malq.19980440411zbMath0915.68166OpenAlexW1986176015MaRDI QIDQ4224086

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

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

Cites Work

• Unnamed Item

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