Towards image realism with interactive update rates in complex virtual building environments
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Visibility preprocessing for interactive walkthroughs
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Computing the antipenumbra of an area light source
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Management of large amounts of data in interactive building walkthroughs
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
Hierarchical Z-buffer visibility
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Visibility computations in densely occluded polyhedral environments
Visibility computations in densely occluded polyhedral environments
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Temporally coherent conservative visibility (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
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
Exact from-region visibility culling
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm
IEEE Transactions on Visualization and Computer Graphics
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
Hardware-Accelerated from-Region Visibility Using a Dual Ray Space
Proceedings of the 12th Eurographics Workshop on Rendering Techniques
Hierarchical Visibility Culling with Occlusion Trees
CGI '98 Proceedings of the Computer Graphics International 1998
Visibility Preprocessing for Urban Scenes using Line Space Subdivision
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
Erosion based visibility preprocessing
EGRW '03 Proceedings of the 14th Eurographics workshop on Rendering
Visibility culling for interactive dynamic scenes
Integrated image and graphics technologies
vLOD: High-Fidelity Walkthrough of Large Virtual Environments
IEEE Transactions on Visualization and Computer Graphics
A general algorithm for output-sensitive visibility preprocessing
Proceedings of the 2005 symposium on Interactive 3D graphics and games
ACM SIGGRAPH 2006 Papers
Direct visibility of point sets
ACM SIGGRAPH 2007 papers
Technical strategies for massive model visualization
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
Granular visibility queries on the GPU
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Adaptive global visibility sampling
ACM SIGGRAPH 2009 papers
An incremental SMLAOI algorithm for progressive downloading large scale WebVR scenes
Proceedings of the 14th International Conference on 3D Web Technology
ACM SIGGRAPH 2009 Courses
An integer incremental AOI algorithm for progressive downloading of large scale VRML environments
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient compression of visibility sets
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Hardware accelerated visibility preprocessing using adaptive sampling
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
FastV: from-point visibility culling on complex models
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
A low dimensional framework for exact polygon-to-polygon occlusion queries
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
Fast exact from-region visibility in urban scenes
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
Aggressive region-based visibility computation using importance sampling
Proceedings of the 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry
EGSR '13 Proceedings of the Eurographics Symposium on Rendering
| Hi-index | 0.00 |
From-region visibility culling is considered harder than from-point visibility culling, since it is inherently four-dimensional. We present a conservative occlusion culling method based on factorizing the 4D visibility problem into horizontal and vertical components. The visibility of the two components is solved asymmetrically: the horizontal component is based on a parameterization of the ray space, and the visibility of the vertical component is solved by incrementally merging umbrae. The technique is designed so that the horizontal and vertical operations can be efficiently realized together by modern graphics hardware. Similar to image-based from-point methods, we use an occlusion map to encode visibility; however, the image-space occlusion map is in the ray space rather than in the primal space. Our results show that the culling time and the size of the computed potentially visible set depend on the size of the viewcell. For moderate viewcells, conservative occlusion culling of large urban scenes takes less than a second, and the size of the potentially visible set is only about two times larger than the size of the exact visible set.