Sampling and Ray Tracing

Monday, 31 July
8:30 - 10:15 am
Hall C
Session Chair: Kavita Bala, Cornell University

Ray Tracing Animated Scenes Using Coherent Grid Traversal
A SIMD packet-frustum traversal scheme for regular grids, which allows a grid-based ray tracer to achieve performance competitive with the fastest known kd-tree traversal methods. Because the grid can be rebuilt per-frame at interactive rates, this approach enables interactive ray tracing for fully animated scenes with no restrictions on the kind of motion possible.

Ingo Wald
Thiago Ize
Andrew Kensler
Aaron Knoll
Steven G. Parker
Scientific Computing and Imaging Institute, University of Utah

Guided Visibility Sampling
This paper addresses the problem of finding triangles visible from a region in space. The proposed aggressive visibility solution uses a combination of stochastic ray shooting and geometry-guided sampling.

Peter Wonka
Arizona State University

Michael Wimmer
Technische Universität Wien

Kaichi Zhou
Arizona State University

Stefan Maierhofer
Gerd Hesina
Zentrum für Virtual Reality und Visualisierung

Alexander Reshetov
Intel Corporation

A Spatial Structure for Fast Poisson-Disk Sample Generation
An efficient and easy-to-implement algorithm for creating Poisson-disk point sets in linear time. This method permits the generation of very large blue-noise point sets.

Daniel Dunbar
Greg Humphreys
University of Virginia

Recursive Wang Tiles for Real-Time Blue Noise
An efficient technique for generating high-quality sampling patterns that match arbitrary density functions. Utilizing progressive and recursive Wang tiles allows local evaluation of infinitely large and non-periodic patterns.

Johannes Kopf
Universität Konstanz

Daniel Cohen-Or
Tel Aviv University

Oliver Deussen
Universität Konstanz

Dani Lischinski
The Hebrew University of Jerusalem