Visibility problems for polyhedral terrains
Journal of Symbolic Computation
Computing point visibility on a terrain based on a nested horizon structure
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Comparison of viewshed algorithms on regular spaced points
SCCG '02 Proceedings of the 18th spring conference on Computer graphics
Advanced Global Illumination
Implicit visibility and antiradiance for interactive global illumination
ACM SIGGRAPH 2007 papers
ACM SIGGRAPH 2007 courses
Horizon-split ambient occlusion
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Real-time, all-frequency shadows in dynamic scenes
ACM SIGGRAPH 2008 papers
Imperfect shadow maps for efficient computation of indirect illumination
ACM SIGGRAPH Asia 2008 papers
Viewshed Computation Based on LOS Scanning
CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 02
Approximating dynamic global illumination in image space
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Multi-layer dual-resolution screen-space ambient occlusion
SIGGRAPH 2009: Talks
Improved visibility computation on massive grid terrains
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
A deferred shading pipeline for real-time indirect illumination
ACM SIGGRAPH 2010 Talks
Fast soft self-shadowing on dynamic height fields
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
Fast global illumination on dynamic height fields
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Fast exact from-region visibility in urban scenes
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
Global illumination systems require intervisibility information between pairs of points in a scene. This visibility problem is computationally complex, and current interactive implementations for dynamic scenes are limited to crude approximations or small amounts of geometry. We present a novel algorithm to determine intervisibility from all points of dynamic height fields as visibility horizons in discrete azimuthal directions. The algorithm determines accurate visibility along each azimuthal direction in time linear in the number of output visibility horizons. This is achieved by using a novel visibility structure we call the convex hull tree. The key feature of our algorithm is its ability to incrementally update the convex hull tree such that at each receiver point only the visible parts of the height field are traversed. This results in low time complexity; compared to previous work, we achieve two orders of magnitude reduction in the number of algorithm iterations and a speedup of 2.4 to 41 on **image** height fields, depending on geometric content. © 2012 Wiley Periodicals, Inc.