Three-dimensional weak visibility: Complexity and applications
type: Item
instance of: scholarly article
title: Three-dimensional weak visibility: Complexity and applications
zbMATH Open document ID: 0944.68179
DOI: 10.1016/S0304-3975(98)00132-7
author: Binhai Zhu
author: Cao An Wang
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1493457
zbMATH Keywords: visibility
zbMATH Keywords: polyhedral terrain
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
cites work: Visibility between two edges of a simple polygon
cites work: Visibility with a moving point of view
cites work: Q4037437
cites work: Guarding polyhedral terrains
cites work: Q4271317
cites work: Arrangements of curves in the plane --- topology, combinatorics, and algorithms
cites work: Characterizing and recognizing weak visibility polygons
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: On a class of \(O(n^2)\) problems in computational geometry
cites work: A simplified technique for hidden-line elimination in terrains
cites work: The shortest watchtower and related problems for polyhedral terrains
cites work: Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
description: scientific article; zbMATH DE number 1493457