|
Volumn , Issue , 2012, Pages 33-37
|
Maximizing parallelism in the construction of bvhs, octrees, and k-d trees
a
a
NVIDIA
(United States)
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BOUNDING VOLUME HIERARCHIES;
BUILDING BLOCKES;
IN-PLACE ALGORITHMS;
K-D TREE;
NUMBER OF METHODS;
OCTREES;
POINT-BASED;
SPACE-FILLING CURVE;
BINARY TREES;
FORESTRY;
INTERACTIVE COMPUTER GRAPHICS;
TREES (MATHEMATICS);
ALGORITHMS;
FORESTRY;
|
EID: 84880815004
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.2312/EGGH/HPG12/033-037 Document Type: Conference Paper |
Times cited : (203)
|
References (10)
|