Compact, Fast and Robust Grids for Ray Tracing Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday, June 25th

Embed Size (px)

DESCRIPTION

Introduction Algorithms in general –CPU-bound Execution time = f( CPU speed ) –Memory-bound Execution time = f( memory speed )  Accelerate by decreasing memory footprint  Minimize memory footprint –Especially for large models