Browsing High-Performance Graphics 2011 by Title
Now showing items 1-20 of 22
-
Active Thread Compaction for GPU Path Tracing
(ACM, 2011)Modern GPUs like NVidia s Fermi internally operate in a SIMD manner by ganging multiple (32) scalar threads together into SIMD warps; if a warp s threads diverge, the warp serially executes both branches, temporarily ... -
Adaptive Transparency
(ACM, 2011)Adaptive transparency is a new solution to order-independent transparency that closely approximates the ground-truth results obtained with A-buffer compositing but, like a Z-buffer, operates in bounded memory and exhibits ... -
The Alchemy Screen-Space Ambient Obscurance Algorithm
(ACM, 2011)Ambient obscurance (AO) produces perceptually important illumination effects such as darkened corners, cracks, and wrinkles; proximity darkening; and contact shadows. We present the AO algorithm from the Alchemy engine ... -
Depth Buffer Compression for Stochastic Motion Blur Rasterization
(ACM, 2011)Previous depth buffer compression schemes are tuned for compressing depths values generated when rasterizing static triangles. They provide generous bandwidth usage savings, and are of great importance to graphics processors. ... -
Farthest-Point Optimized Point Sets with Maximized Minimum Distance
(ACM, 2011)Efficient sampling often relies on irregular point sets that uniformly cover the sample space. We present a flexible and simple optimization strategy for such point sets. It is based on the idea of increasing the mutual ... -
Hierarchical Stochastic Motion Blur Rasterization
(ACM, 2011)We present a hierarchical traversal algorithm for stochastic rasterization of motion blur, which efficiently reduces the number of inside tests needed to resolve spatio-temporal visibility. Our method is based on novel ... -
High-Performance Software Rasterization on GPUs
(ACM, 2011)In this paper, we implement an efficient, completely software-based graphics pipeline on a GPU. Unlike previous approaches, we obey ordering constraints imposed by current graphics APIs, guarantee hole-free rasterization, ... -
Improving SIMD Efficiency for Parallel Monte Carlo Light Transport on the GPU
(ACM, 2011)Monte Carlo Light Transport algorithms such as Path Tracing (PT), Bi-Directional Path Tracing (BDPT) and Metropolis Light Transport (MLT) make use of random walks to sample light transport paths. When parallelizing these ... -
An Inexpensive Bounding Representation for Offsets of Quadratic Curves
(ACM, 2011)We describe a simple mechanism for bounding the portion of the plane lying between a quadratic Beizer curve segment and its offset curve at distance d. Instead of comprising one or more partial bounding polygons, our ... -
Lossless Compression of Already Compressed Textures
(ACM, 2011)Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphics processor and memory, increasing performance ... -
MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur
(ACM, 2011)When a bounding volume hierarchy is used for accelerating the intersection of rays and scene geometry, one common way to incorporate motion blur is to interpolate node bounding volumes according to the time of the ray. ... -
Precision Selection for Energy-Effi cient Pixel Shaders
(ACM, 2011)In this work, we seek to realize energy savings in modern pixel shaders by reducing the precision of their arithmetic. We explore three schemes for controlling this reduction. The first is a static analysis technique, which ... -
Preface and Table of Contents
(ACM, 2011) -
Primitive Processing and Advanced Shading Architecture for Embedded Space
(ACM, 2011)This paper presents a new graphics architecture enabling contentrich applications for the embedded space by extending hardware architecture in two main areas - geometry processing and configurable per-fragment shading. Our ... -
Randomized Selection on the GPU
(ACM, 2011)We implement here a fast and memory-sparing probabilistic top k selection algorithm on the GPU. The algorithm proceeds via an iterative probabilistic guess-and-check process on pivots for a three-way partition. When the ... -
Rapid Simplifi cation of Multi-Attribute Meshes
(ACM, 2011)We present a rapid simplification algorithm for meshes with multiple vertex attributes, targeted at rendering acceleration for realtime applications. Such meshes potentially feature normals, tangents, one or more texture ... -
Real-Time Diffuse Global Illumination Using Radiance Hints
(ACM, 2011)GPU-based interactive global illumination techniques are receiving an increasing interest from both the research and the industrial community as real-time graphics applications strive for vi-sually rich and realistic dynamic ... -
SAH KD-Tree Construction on GPU
(ACM, 2011)KD-tree is one of the most efficient acceleration data structures for ray tracing. In this paper, we present a kd-tree construction algorithm that is precisely SAH-optimized and runs entirely on GPU. We construct the tree ... -
Simpler and Faster HLBVH with Work Queues
(ACM, 2011)A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed forray tracing in real-time, even in the presence of ... -
SSLPV: Subsurface Light Propagation Volumes
(ACM, 2011)This paper presents the Subsurface Light Propagation Volume (SSLPV) method for real-time approximation of subsurface scattering effects in dynamic scenes with changing mesh opology and lighting. SSLPV extends the Light ...