Three-dimensional weak visibility: Complexity and applications

DOI10.1016/S0304-3975(98)00132-7zbMath0944.68179MaRDI QIDQ1575678

Binhai Zhu, Cao An Wang

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

visibilitycomputational geometrypolyhedral terrain

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Visibility maps of segments and triangles in 3D

Cites Work

• Unnamed Item
• Unnamed Item
• On a class of \(O(n^2)\) problems in computational geometry
• Guarding polyhedral terrains
• Characterizing and recognizing weak visibility polygons
• Visibility between two edges of a simple polygon
• The shortest watchtower and related problems for polyhedral terrains
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Visibility with a moving point of view
• Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• A simplified technique for hidden-line elimination in terrains

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