Three dimensional weak visibility: Complexity and applications

DOI10.1007/BFB0030819MaRDI QIDQ6064014zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Three-dimensional weak visibility: Complexity and applications
• Visibility maps of segments and triangles in 3D
• Visibility Maps of Segments and Triangles in 3D
• scientific article; zbMATH DE number 4043246
• Efficient algorithms for computing a complete visibility region in three-dimensional space

Cites work

• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Characterizing and recognizing weak visibility polygons
• Fat Triangles Determine Linearly Many Holes
• scientific article; zbMATH DE number 4050998 (Why is no real title available?)
• scientific article; zbMATH DE number 177566 (Why is no real title available?)
• scientific article; zbMATH DE number 464639 (Why is no real title available?)
• On a class of \(O(n^ 2)\) problems in computational geometry
• Visibility between two edges of a simple polygon
• Visibility with a moving point of view

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

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