Exploiting coherence in hierarchical visibility algorithms

被引:4
作者
Bittner, J [1 ]
Havran, V [1 ]
机构
[1] Czech Tech Univ, Ctr Appl Cybernet, Prague 12135 2, Czech Republic
来源
JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION | 2001年 / 12卷 / 05期
关键词
visibility culling; coherence; 4D-tree;
D O I
10.1002/vis.269
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating:avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visibility tests of the hierarchy nodes that are expected to remain visible. We evaluate the presented methods in the context of hierarchical visibility culling using occlusion trees. Copyright (C) 2002 John Wiley Sons, Ltd.
引用
收藏
页码:277 / 286
页数:10
相关论文
共 12 条
[1]  
[Anonymous], P 14 SPRING C COMP G
[2]  
[Anonymous], 1989, The Design and Analysis of Spatial Data Structures
[3]   Hierarchical visibility culling with occlusion trees [J].
Bittner, J ;
Havran, V ;
Slavik, P .
COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS, 1998, :207-219
[4]  
Coorg S., 1997, Proceedings 1997 Symposium on Interactive 3D Graphics, P83, DOI 10.1145/253284.253312
[5]  
COORG S, 1996, P 10 ANN ACM S COMP
[6]  
Fuchs H., 1980, Computer Graphics, V14, P124, DOI 10.1145/965105.807481
[7]  
Greene N., 1996, Computer Graphics Proceedings. SIGGRAPH '96, P65, DOI 10.1145/237170.237207
[8]  
Greene N., 1993, Computer Graphics Proceedings, P231, DOI 10.1145/166117.166147
[9]  
HUDSON T, 1997, P 13 ACM S COMP GEOM
[10]  
ROHLF J, 1994, P SIGGRAPH 94, P381