A survey of visibility for walkthrough applications
- 25 June 2003
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 9 (3) , 412-431
- https://doi.org/10.1109/tvcg.2003.1207447
Abstract
Visibility algorithms for walkthrough and related applications have grown into a significant area, spurred by the growth in the complexity of models and the need for highly interactive ways of navigating them. In this survey, we review the fundamental issues in visibility and conduct an overview of the visibility culling techniques developed in the last decade. The taxonomy we use distinguishes point-based methods from-region methods. Point-based methods are further subdivided into object and image-precision techniques, while from-region approaches can take advantage of the cell-and-portal structure of architectural environments or handle generic scenes.Keywords
This publication has 65 references indexed in Scilit:
- Directional Discretized Occluders for Accelerated Occlusion CullingComputer Graphics Forum, 2000
- Efficient Algorithms for Computing Conservative Portal Visibility InformationComputer Graphics Forum, 2000
- Optimized View Frustum Culling Algorithms for Bounding BoxesJournal of Graphics Tools, 2000
- A qualitative and quantitative visibility analysis in urban scenesComputers & Graphics, 1999
- The visibility octree: a data structure for 3D navigationComputers & Graphics, 1999
- Interactive ray tracing with the visibility complexComputers & Graphics, 1999
- Hierarchical back-face computationComputers & Graphics, 1999
- Optimized occlusion culling using five-dimensional subdivisionComputers & Graphics, 1999
- A rapid hierarchical radiosity algorithmACM SIGGRAPH Computer Graphics, 1991
- Near real-time shadow generation using BSP treesACM SIGGRAPH Computer Graphics, 1989