Three dimensional weak visibility: Complexity and applications

DOI10.1007/bfb0030819zbMath1527.68250OpenAlexW1497100938MaRDI QIDQ6064014

Unnamed Author, Binhai Zhu

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030819

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing and recognizing weak visibility polygons
• Visibility between two edges of a simple polygon
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Visibility with a moving point of view
• On a class of \(O(n^ 2)\) problems in computational geometry
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Fat Triangles Determine Linearly Many Holes

This page was built for publication: Three dimensional weak visibility: Complexity and applications