LOD visibility culling and occluder synthesis

被引:18
作者
Andújar, C [1 ]
Saona-Vázquez, C [1 ]
Navazo, I [1 ]
机构
[1] Univ Politecn Cataluna, Dept Llenguatges & Sistemes Informat, E-08028 Barcelona, Spain
关键词
occlusion culling; occluder synthesis; level of detail;
D O I
10.1016/S0010-4485(00)00067-1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Level-of-detail occlusion culling is a novel approach to the management of occluders that can be easily integrated into most current visibility culling algorithms. The main contribution of this paper is an algorithm that automatically generates sets of densely overlapping boxes with enhanced occlusion properties from non-convex subsets. We call this method occluder synthesis because it is not sensitive to the way the objects are tesselated but to the space enclosed by them. The extension of this technique by allowing a bounded amount of image error is also discussed. We show that visibility computations can be based on a multiresolution model which provides several representations of these occluders with varying visibility accuracy. Our tests show that occlusion performance in tesselated scenes is improved severely even if no image-error is allowed. (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:773 / 783
页数:11
相关论文
共 23 条
[1]  
Amenta N., 1994, Proceedings of the Tenth Annual Symposium on Computational Geometry, P340, DOI 10.1145/177424.178064
[2]  
Andujar C., 1999, THESIS U POLITECNICA
[3]   A linear-time algorithm for covering simple polygons with similar rectangles [J].
BarYehuda, R ;
BenHanoch, E .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (01) :79-102
[4]  
BRUNET P, 1994, DATA VISUALIZATION, P157
[5]   A POLYNOMIAL SOLUTION FOR THE POTATO-PEELING PROBLEM [J].
CHANG, JS ;
YAP, CK .
DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (02) :155-182
[6]  
CHAZELLE B, 1985, P S COMP GEOM BALT M, P63
[7]  
Cohen-Or D, 1998, COMPUT GRAPH FORUM, V17, pC243, DOI 10.1111/1467-8659.00271
[8]  
Coorg S., 1997, Proceedings 1997 Symposium on Interactive 3D Graphics, P83, DOI 10.1145/253284.253312
[9]   COVERING POLYGONS IS HARD [J].
CULBERSON, JC ;
RECKHOW, RA .
JOURNAL OF ALGORITHMS, 1994, 17 (01) :2-44
[10]   Finding the largest area axis-parallel rectangle in a polygon [J].
Daniels, K ;
Milenkovic, V ;
Roth, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (1-2) :125-148