|
Volumn , Issue , 2008, Pages
|
Compact, fast and robust grids for ray tracing
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ACCELERATION STRUCTURES;
BOUND ALGORITHMS;
BOUNDING VOLUME HIERARCHIES;
BUILD TIME;
COMPACT GRIDS;
DYNAMIC SCENES;
EFFICIENT METHODS;
EXECUTION TIME;
FAST ALGORITHMS;
GLOBAL ILLUMINATIONS;
GRID CELLS;
GRID METHODS;
GRID SIZES;
INTERACTIVE VISUALIZATIONS;
K-D TREES;
LINEAR TIME;
MEMORY FOOTPRINTS;
MEMORY REQUIREMENTS;
MEMORY USAGES;
OBJECT REFERENCES;
OFFLINE;
PARALLELIZING;
PERFECT HASHING;
PREPROCESSING TIME;
TIME AND SPACES;
TRAVERSAL ALGORITHMS;
UNIFORM GRIDS;
ALGORITHMS;
BENCHMARKING;
BUILDINGS;
DATA STRUCTURES;
ELEMENTARY PARTICLE SOURCES;
RAY TRACING;
ACCELERATION;
|
EID: 65249169999
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/1401032.1401059 Document Type: Conference Paper |
Times cited : (7)
|
References (1)
|