Optimized occlusion culling using five-dimensional subdivision

被引：15

作者：

Gotsman, C ^{[1
]}

Sudarsky, O ^{[1
]}

Fayman, JA ^{[1
]}

机构：

[1] Virtue Ltd, IL-30200 Tirat Camel, Israel

来源：

COMPUTERS & GRAPHICS-UK | 1999年 / 23卷 / 05期

关键词：

occlusion culling; k-D trees; 5D spatial subdivision;

D O I：

10.1016/S0097-8493(99)00088-6

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We describe an algorithm for occlusion culling by visibility preprocessing. The algorithm intelligently partitions the five-dimensional viewing parameter space using a SD tree (a k-D tree with k = 5), such that each leaf of the tree contains a reference to a subset of the n scene objects. The visibility of each of the objects is determined using a ray-casting procedure. We show how to minimize the number of rays cast in order to achieve a reliable estimate of the visibility relations, and how to efficiently code the resulting 5D tree. (C) 1999 Elsevier Science Ltd. All rights reserved.

引用

页码：645 / 654

页数：10

共 27 条

[1] Airey J. M., 1990, Computer Graphics, V24, P41, DOI 10.1145/91394.91416
[2] Arvo J., 1987, SIGGRAPH 87, P55
[3] CHRYSANTHOU Y, 1988, P COMP GRAPH INT, P220
[4] HIERARCHICAL GEOMETRIC MODELS FOR VISIBLE SURFACE ALGORITHMS
CLARK, JH
[J]. COMMUNICATIONS OF THE ACM, 1976, 19 (10) : 547 - 554
[5] Cohen-Or D, 1998, COMPUT GRAPH FORUM, V17, pC243, DOI 10.1111/1467-8659.00271
[6] COORG S, 1997, P S INT 3D GRAPH ACM
[7] FUNKHOUSER T.A., 1992, SI3D 92, P11
[8] Funkhouser TA, 1996, PROC GRAPH INTERF, P1
[9] GREENE N, 1993, ANN C SERIES, P231
[10] GREENE N, 1996, ANN C SERIES, P65

← 1 2 3 →