Guided visibility sampling
- 1 July 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 25 (3) , 494-502
- https://doi.org/10.1145/1141911.1141914
Abstract
This paper addresses the problem of computing the triangles visible from a region in space. The proposed aggressive visibility solution is based on stochastic ray shooting and can take any triangular model as input. We do not rely on connectivity information, volumetric occluders, or the availability of large occluders, and can therefore process any given input scene. The proposed algorithm is practically memoryless, thereby alleviating the large memory consumption problems prevalent in several previous algorithms. The strategy of our algorithm is to use ray mutations in ray space to cast rays that are likely to sample new triangles. Our algorithm improves the sampling efficiency of previous work by over two orders of magnitude.This publication has 23 references indexed in Scilit:
- RPUACM Transactions on Graphics, 2005
- Multi-level ray tracing algorithmACM Transactions on Graphics, 2005
- vLOD: High-Fidelity Walkthrough of Large Virtual EnvironmentsIEEE Transactions on Visualization and Computer Graphics, 2005
- Feature article - dPVS: an occlusion culling system for massive dynamic environmentsIEEE Computer Graphics and Applications, 2004
- Ray space factorization for from-region visibilityACM Transactions on Graphics, 2003
- Simplifying complex environments using incremental textured depth meshesACM Transactions on Graphics, 2003
- Instant VisibilityComputer Graphics Forum, 2001
- LOD visibility culling and occluder synthesisComputer-Aided Design, 2000
- Optimized occlusion culling using five-dimensional subdivisionComputers & Graphics, 1999
- An Integral Geometry Based Method for Fast Form‐Factor ComputationComputer Graphics Forum, 1993