Sciweavers

Share
EGH
2010
Springer
8 years 9 months ago
Real time volumetric shadows using polygonal light volumes
This paper presents a more efficient way of computing single scattering effects in homogeneous participating media for real-time purposes than the currently popular ray-marching b...
Markus Billeter, Erik Sintorn, Ulf Assarsson
EGH
2010
Springer
8 years 9 months ago
Large data visualization on distributed memory multi-GPU clusters
Thomas Fogal, Hank Childs, Siddharth Shankar, Jens...
EGH
2010
Springer
8 years 9 months ago
Architecture considerations for tracing incoherent rays
This paper proposes a massively parallel hardware architecture for efficient tracing of incoherent rays, e.g. for global illumination. The general approach is centered around hier...
Timo Aila, Tero Karras
EGH
2010
Springer
8 years 9 months ago
Analytical motion blur rasterization with compression
We present a rasterizer, based on time-dependent edge equations, that computes analytical visibility in order to render accurate motion blur. The theory for doing the computations...
Carl Johan Gribel, Michael C. Doggett, Tomas Akeni...
EGH
2010
Springer
8 years 9 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
EGH
2010
Springer
8 years 9 months ago
Space-time hierarchical occlusion culling for micropolygon rendering with motion blur
Solomon Boulos, Edward Luong, Kayvon Fatahalian, H...
EGH
2010
Springer
8 years 9 months ago
Hardware implementation of micropolygon rasterization with motion and defocus blur
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. Additionally, they do not natively support triangle rasterization with jittered samp...
J. S. Brunhaver, Kayvon Fatahalian, Pat Hanrahan
EGH
2010
Springer
8 years 9 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
EGH
2010
Springer
8 years 9 months ago
A lazy object-space shading architecture with decoupled sampling
We modify the Reyes object-space shading approach to address two inefficiencies that result from performing shading calculations at micropolygon grid vertices prior to rasterizati...
Christopher A. Burns, Kayvon Fatahalian, William R...
EGH
2010
Springer
8 years 9 months ago
AnySL: efficient and portable shading for ray tracing
While a number of different shading languages have been developed, their efficient integration into an existing renderer is notoriously difficult, often boiling down to implementi...
Ralf Karrenberg, Dmitri Rubinstein, Philipp Slusal...
books