Last update: Sun Oct 15 02:29:44 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Havran:1997:FRB,
author = "Vlastimil Havran and Tomas Kopal and Jiri Bittner and
Jiri Zara",
title = "Fast Robust {BSP} Tree Traversal Algorithm for Ray
Tracing",
journal = j-J-GRAPHICS-TOOLS,
volume = "2",
number = "4",
pages = "15--24",
year = "1997",
CODEN = "JGTOFD",
ISSN = "1086-7651",
ISSN-L = "1086-7651",
bibdate = "Thu Oct 12 17:08:13 2000",
bibsource = "http://www.acm.org/jgt/issues.html;
http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib",
URL = "http://www.acm.org/jgt/papers/HavranKopalBittnerZara97/",
abstract = "An orthogonal BSP (binary space partitioning) tree is
a commonly used spatial subdivision data structure for
ray tracing acceleration. While the construction of a
BSP tree takes a relatively short time, the efficiency
of a traversal algorithm significantly influences the
overall rendering time. We propose a new fast traversal
algorithm based on statistical evaluation of all
possible cases occurring during traversing a BSP tree.
More frequent cases are handled simply, while less
frequent ones are more computationally expensive. The
proposed traversal algorithm handles all singularities
correctly. The algorithm saves from 30\% up to 50\% of
traversal time comparing with the commonly-known Sung
and Arvo algorithms.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.tandfonline.com/loi/ujgt20",
}
Related entries
- acceleration,
4(1)11,
5(2)1,
7(4)33
- all,
1(2)31,
1(3)1,
2(1)29,
2(3)45,
2(4)25,
3(2)21,
3(3)29,
3(4)13,
4(4)23,
5(4)1,
5(4)13,
6(2)27,
6(4)13,
7(3)27,
7(4)61,
7(4)69,
7(4)83,
9(1)1,
10(2)27
- based,
1(2)31,
1(3)13,
1(4)21,
2(1)1,
2(2)1,
2(3)1,
2(3)29,
2(4)25,
3(2)15,
3(4)1,
4(1)11,
4(1)25,
4(2)27,
4(3)1,
4(3)23,
4(4)5,
5(3)11,
5(4)1,
5(4)25,
5(4)33,
6(2)27,
6(2)43,
7(1)23,
7(1)33,
7(1)45,
7(2)17,
7(2)27,
7(3)43,
7(4)27,
7(4)83,
8(2)41,
8(4)1,
9(1)23,
9(2)21,
17(3)59
- binary,
8(4)25
- BSP,
8(4)25
- case,
1(2)25,
2(3)29,
3(4)13,
4(3)11,
6(3)37,
6(4)13,
7(1)23,
7(2)27,
7(3)43,
7(4)3,
7(4)53,
7(4)69,
8(2)1,
8(2)31
- commonly,
3(1)43,
8(4)25
- comparing,
5(1)9,
5(4)25
- computationally,
2(2)1,
2(2)31,
3(2)21,
4(4)37,
5(4)1,
6(4)41
- construction,
1(4)21,
7(4)69,
8(1)25,
14(1)55,
17(1)45
- correctly,
3(4)13,
7(1)23,
7(4)61
- data,
1(1)21,
1(4)21,
3(1)33,
3(3)1,
3(4)1,
4(4)11,
6(1)1,
6(4)13,
7(1)33,
7(2)27,
8(2)1,
8(3)1,
9(2)21,
9(3)1,
10(2)41,
17(4)113
- during,
1(2)31,
4(1)11,
4(3)1,
7(4)9
- efficiency,
1(2)31,
3(2)1,
4(1)11,
4(4)5,
8(3)41,
12(1)9
- evaluation,
5(4)25,
10(2)13,
12(3)7,
15(3)183
- expensive,
1(2)25,
2(2)1,
2(2)31,
4(4)37,
5(1)1
- fast,
1(2)25,
1(2)31,
1(3)1,
2(1)21,
2(2)25,
2(3)29,
3(4)1,
3(4)33,
4(2)7,
4(2)37,
4(4)5,
5(2)33,
5(4)25,
6(1)29,
6(2)1,
6(2)27,
6(2)43,
6(4)1,
6(4)13,
6(4)29,
7(1)23,
7(2)9,
7(2)17,
7(3)27,
7(3)43,
7(4)69,
7(4)91,
8(1)16,
8(1)25,
8(2)17,
8(4)1,
8(4)37,
9(1)23,
9(1)35,
9(2)1,
9(2)11,
9(3)21,
10(2)41,
10(3)13,
11(2)37,
11(4)39,
12(2)59,
12(4)35,
12(4)47,
13(3)53,
14(2)1,
15(3)161,
17(1)17
- handle,
4(3)35,
7(3)27
- handled,
7(3)27
- less,
1(2)25,
2(4)1,
3(1)15,
5(3)11,
6(1)7
- more,
1(1)3,
1(1)33,
2(2)31,
3(2)1,
3(2)21,
4(1)11,
4(2)27,
6(2)27,
6(4)29,
7(2)27,
7(4)69,
8(1)25,
8(2)31,
8(2)41,
9(1)23,
9(3)1
- new,
1(1)3,
3(4)1,
3(4)33,
4(1)1,
4(1)39,
4(2)1,
4(3)23,
4(4)23,
5(1)1,
5(2)15,
5(4)25,
6(1)7,
6(2)1,
6(3)37,
7(1)13,
7(2)41,
7(4)69,
8(1)3,
8(3)1,
8(4)25,
9(1)23,
9(2)1,
9(3)21
- one,
1(2)1,
1(3)1,
2(2)31,
3(3)1,
4(2)27,
4(3)11,
4(4)1,
6(1)35,
6(2)27,
6(2)43,
7(2)9,
8(1)16,
8(1)25,
8(3)1,
9(3)21,
14(1)63
- overall,
7(1)1,
8(3)23
- possible,
3(2)21,
5(3)35,
8(1)3,
8(3)41,
9(3)41
- propose,
1(4)41,
2(3)15,
3(1)15,
3(4)13,
4(2)1,
5(4)9,
6(1)7,
6(1)35,
7(4)83
- proposed,
1(3)29,
3(3)11,
4(1)1,
4(1)25,
5(4)25,
6(1)7,
6(4)41,
7(1)23,
7(1)45,
7(4)61,
8(1)25,
9(1)13
- ray,
1(3)29,
1(4)41,
2(1)21,
2(2)9,
3(2)1,
4(1)11,
4(3)1,
5(1)27,
6(1)29,
6(4)13,
7(1)13,
7(2)1,
7(2)41,
8(4)37,
9(1)35,
9(3)1,
9(3)41,
11(2)1,
11(3)27,
11(4)1,
11(4)61,
12(4)35,
14(4)31,
15(3)141,
17(4)127
- relatively,
1(2)25
- rendering,
1(2)1,
1(3)1,
1(3)29,
2(2)31,
3(2)1,
4(1)11,
4(2)27,
4(2)37,
4(3)1,
4(3)35,
4(4)11,
4(4)37,
5(4)33,
6(1)1,
6(1)19,
6(2)1,
6(3)1,
6(4)1,
7(2)1,
7(4)27,
7(4)33,
7(4)43,
7(4)53,
7(4)61,
7(4)69,
7(4)83,
8(3)1,
8(4)1,
8(4)21,
8(4)25,
9(1)1,
9(3)21,
10(1)55,
10(2)1,
11(1)1,
13(2)21,
14(1)1,
14(2)61,
14(3)1,
14(4)57,
15(1)1,
16(1)40,
16(2)105,
16(3)123
- robust,
1(1)33,
2(3)45,
4(2)7,
6(4)13,
7(2)9,
7(3)27,
8(1)25,
8(2)17,
8(2)31,
8(4)37,
9(3)41,
10(1)49,
13(1)19
- short,
2(1)1,
5(1)1,
8(4)21
- significantly,
5(2)33,
5(3)11,
6(4)1,
7(2)41,
8(4)25
- simply,
7(2)27,
9(1)35
- singularity,
3(3)29
- space,
2(2)1,
2(3)29,
4(1)11,
4(4)11,
5(2)15,
5(3)1,
5(4)9,
6(1)7,
6(2)1,
6(2)27,
6(2)43,
7(3)27,
7(4)83,
8(1)3,
8(3)41,
9(4)57
- spatial,
5(2)15,
6(4)13,
7(1)1
- structure,
3(4)1,
5(3)35,
6(1)7,
6(2)43,
7(2)27,
9(2)21,
10(2)41
- subdivision,
2(2)1,
5(3)1,
5(3)35,
6(1)35,
6(3)29,
6(4)1,
6(4)13,
7(1)33,
9(3)1,
9(4)3,
12(3)7,
12(4)1,
14(2)61
- take,
1(3)1,
3(3)11,
4(1)25,
4(3)1,
5(2)33,
6(2)27,
6(2)43,
6(4)1,
7(4)43
- time,
1(2)25,
1(3)1,
2(2)1,
3(4)1,
3(4)13,
4(3)1,
4(4)23,
5(1)9,
5(2)1,
5(4)33,
6(1)7,
6(1)29,
6(3)1,
7(1)23,
7(1)33,
7(2)1,
7(2)27,
7(4)69,
8(3)23,
9(2)21
- tracing,
1(3)29,
1(4)41,
2(2)9,
3(2)1,
4(3)1,
5(1)27,
6(4)13,
7(1)13,
7(2)41,
9(1)13,
9(3)41,
11(2)1,
11(4)61,
14(2)33,
14(4)31,
15(3)141
- traversal,
4(3)11,
7(3)1
- tree,
2(4)1,
7(3)1,
8(4)25,
9(2)1,
11(4)17,
13(1)57,
15(1)1
- used,
1(3)1,
1(3)7,
1(3)13,
1(3)29,
1(4)21,
2(1)1,
2(1)29,
2(2)9,
2(2)25,
2(3)29,
2(3)45,
3(1)43,
3(2)21,
3(3)1,
3(3)29,
4(1)1,
4(4)11,
4(4)37,
5(1)9,
6(1)29,
6(2)1,
6(2)43,
6(3)1,
6(4)41,
7(3)1,
7(3)19,
7(4)33,
7(4)53,
8(1)3,
8(2)1,
8(2)17,
8(3)41,
8(4)1,
8(4)21,
8(4)25,
9(1)1,
9(3)1
- while,
1(4)21,
2(1)1,
2(2)31,
4(1)39,
5(1)27,
5(3)11,
7(4)33,
8(2)31,
9(2)21