Visibility preprocessing for interactive walkthroughs
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Hierarchical Z-buffer visibility
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Real-time occlusion culling for models with large occluders
Proceedings of the 1997 symposium on Interactive 3D graphics
Visibility culling using hierarchical occlusion maps
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Accelerated occlusion culling using shadow frusta
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Conservative volumetric visibility with occluder fusion
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Conservative visibility preprocessing using extended projections
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Optimized view frustum culling algorithms for bounding boxes
Journal of Graphics Tools
Occlusion horizons for driving through urban scenery
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Exact minkowski sums and applications
Proceedings of the eighteenth annual symposium on Computational geometry
Exact from-region visibility culling
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Occlusion Culling Algorithms: A Comprehensive Survey
Journal of Intelligent and Robotic Systems
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Virtual Occluders: An Efficient Intermediate PVS Representation
Proceedings of the Eurographics Workshop on Rendering Techniques 2000
Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs
Proceedings of the Eurographics Workshop on Rendering Techniques 2000
Ray space factorization for from-region visibility
ACM SIGGRAPH 2003 Papers
Visibility Preprocessing for Urban Scenes using Line Space Subdivision
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
A survey of visibility for walkthrough applications
IEEE Transactions on Visualization and Computer Graphics
Effective compression techniques for precomputed visibility
EGWR'99 Proceedings of the 10th Eurographics conference on Rendering
vLOD: High-Fidelity Walkthrough of Large Virtual Environments
IEEE Transactions on Visualization and Computer Graphics
Visibility-based feature extraction from discrete models
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Single-pass GPU solid voxelization for real-time applications
GI '08 Proceedings of graphics interface 2008
Technical Section: Emergency crowd simulation for outdoor environments
Computers and Graphics
| Hi-index | 0.00 |
This paper presents a novel method for computing visibility in 2.5D environments based on a novel theoretical result: the visibility from a region can be conservatively estimated by computing the visibility from a point using appropriately "shrunk" occluders and occludees. We show how approximate, yet conservative, shrunk objects can be efficiently computed in an urban environment. The technique provides a tighter potentially visible set (PVS) compared to the original method in which only occluders are shrunk. Finally, theoretical implications of the shrinking theorem are discussed, opening new research directions.