ABSTRACT
In this paper we propose a global visibility algorithm which computes from-region visibility for all view cells simultaneously in a progressive manner. We cast rays to sample visibility interactions and use the information carried by a ray for all view cells it intersects. The main contribution of the paper is a set of adaptive sampling strategies based on ray mutations that exploit the spatial coherence of visibility. Our method achieves more than an order of magnitude speedup compared to per-view cell sampling. This provides a practical solution to visibility preprocessing and also enables a new type of interactive visibility analysis application, where it is possible to quickly inspect and modify a coarse global visibility solution that is constantly refined.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
John M. Airey , John H. Rohlf , Frederick P. Brooks, Jr., Towards image realism with interactive update rates in complex virtual building environments, Proceedings of the 1990 symposium on Interactive 3D graphics, p.41-50, February 1990, Snowbird, Utah, United States
|
| |
2
|
|
| |
3
|
Bittner, J. 2003. Hierarchical Techniques for Visibility Computations. PhD thesis, Czech Technical University in Prague.
|
| |
4
|
Cohen-Or, D., Fibich, G., Halperin, D., and Zadicario, E. 1998. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. Computer Graphics Forum (Eurographics '98) 17, 3, 243--254.
|
| |
5
|
Cohen-Or, D., Chrysanthou, Y. L., Silva, C. T., and Durand, F. 2003. A survey of visibility for walkthrough applications. IEEE Trans. On Visualization and Computer Graphics 9, 3, 412--431.
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
Gotsman, C., Sudarsky, O., and Fayman, J. A. 1999. Optimized occlusion culling using five-dimensional subdivision. Computers and Graphics 23, 5, 645--654.
|
| |
11
|
Hastings, A., 2007. Occlusion systems. Insomniac Games Tech Presentation. http://www.insomniacgames.com/tech/articles/1107/occlusion.php.
|
| |
12
|
Haumont, D., Mäkinen, O., and Nirenstein, S. 2005. A low dimensional framework for exact polygon-to-polygon occlusion queries. In Rendering Techniques '05, 211--222.
|
| |
13
|
|
 |
14
|
|
| |
15
|
Lepage, G. 1980. Vegas: An adaptive multidimensional integration program. Tech. Rep. CLNS-80/447, Cornell University.
|
 |
16
|
|
 |
17
|
|
| |
18
|
Mattausch, O., Bittner, J., and Wimmer, M. 2006. Adaptive visibility-driven view cell construction. In Rendering Techniques '06, 195--206.
|
| |
19
|
Mattausch, O., Bittner, J., and Wimmer, M. 2008. CHC++: Coherent hierarchical culling revisited. Computer Graphics Forum (Eurographics '08) 27, 3 (Apr.), 221--230.
|
| |
20
|
Nirenstein, S., and Blake, E. 2004. Hardware accelerated visibility preprocessing using adaptive sampling. In Rendering Techniques '04, 207--216.
|
| |
21
|
|
| |
22
|
|
 |
23
|
|
| |
24
|
|
| |
25
|
Shirley, P., Slusallek, P., Wald, I., Mark, B., Stoll, G., and Manocha, D. 2006. SIGGRAPH 2006 course 4, State of the art in interactive ray tracing.
|
 |
26
|
|
| |
27
|
Thompson, S. K., and Seber, G. A. F. 1996. Adaptive Sampling. Wiley.
|
| |
28
|
van de Panne, M., and Stewart, A. J. 1999. Effective compression techniques for precomputed visibility. In Rendering Techniques '99, 305--316.
|
| |
29
|
|
 |
30
|
|
| |
31
|
|
 |
32
|
|
|