Three-dimensional weak visibility: Complexity and applications

DOI10.1016/S0304-3975(98)00132-7MaRDI QIDQ1575678zbMATH OpenFDO

Authors Binhai Zhu, Cao An Wang

Publication date 21 August 2000

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

zbMATH Keywords

computational geometryvisibilitypolyhedral terrain

Mathematics Subject Classification ID

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

Recommendations

• 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
• Characterizing and recognizing weak visibility polygons

Cites work

• scientific article; zbMATH DE number 177566 (Why is no real title available?)
• scientific article; zbMATH DE number 464639 (Why is no real title available?)
• A simplified technique for hidden-line elimination in terrains
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Characterizing and recognizing weak visibility polygons
• Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
• Guarding polyhedral terrains
• On a class of \(O(n^2)\) problems in computational geometry
• The shortest watchtower and related problems for polyhedral terrains
• Visibility between two edges of a simple polygon
• Visibility with a moving point of view

Cited in

(3)

• Guarding precise and imprecise polyhedral terrains with segments
• Three dimensional weak visibility: Complexity and applications
• Visibility maps of segments and triangles in 3D

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