Efficient Reconstruction of Indoor Scenes with Color (2003)
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence values directly from a...
A Multigrid Solver for Boundary Value Problems Using Programmable Graphics Hardware (2003)
M. Doggett, W. Heidrich, W. Mark, A. Schilling (editors, Nolan Goodnight, Cliff Woolley, ...
We present a case study in the application of graphics hardware to general-purpose numeric computing. Specifically, we describe a system, built on programmable graphics hardware, able to solve a...
GLOD: Level of Detail for the Masses (2003)
We present GLAD, a geometric level of detail system integrated into the apenGL rendering library. GLaD provides a low-level, lightweight API for level of detail operations. Unlike heavyweight scene...
A Multigrid Solver for Boundary-Value Problems Using (2003)
Nolan Goodnight, Gregory Lewint, David Luebke, Kevin Skadron
We present a method for using programmable graphics hardware to solve a variety of boundary value problems. The time-evolution of such problems is frequently governed by partial differential...
A Multigrid Solver for Boundary Value Problems Using Programmable Graphics Hardware (2003)
Nolan Goodnight, Gregory Lewin, David Luebke, Kevin Skadron
We present a method for using programmable graphics hardware to solve a variety of boundary value problems. The time-evolution of such problems is frequently governed by partial differential...
Nathaniel Williams, David Luebke, Jonathan D. Cohen, Michael Kelley, Brenden Schubert
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-level human vision to...
Interruptible Rendering (2002)
J. Cliff Woolley, David Luebke, Ben Watson
Interruptible rendering is a novel approach to the fidelity-versusperformance tradeoff ubiquitous in real-time rendering. Interruptible rendering unifies spatial error, caused by rendering coarse...
Improving Frameless Rendering By Focusing on Change (2002)
Abhinav Dayal, Benjamin Watson, David Luebke
pixel is changing, neighboring pixels are likely also changing. The probability that one of the pixels in a tile will be rendered is computed using the summed probabilities of the component pixels,...
Perceptually Driven Simplification for (2001)
We present a framework for accelerating interactive rendering, grounded in psychophysical models of visual perception. This framework is applicable to multiresolution rendering techniques that use a...
View-Dependent Particles for Interactive Non-Photorealistic Rendering (2001)
Derek Cornish, Andrea Rowan, David Luebke
We present a novel framework for non-photorealistic rendering (NPR) based on view-dependent geometric simplification techniques. Following a common thread in NPR research, we represent the model as a...
View-Dependent Simplification Of Arbitrary Polygonal Environments (2001)
Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the...
Perceptually Driven Simplification Using Gaze-Directed Rendering (2000)
David Luebke, Benjamin Hallen, Dale Newfield, Benjamin Watson
We present a unique polygonal simplification method grounded in rigorous perceptual science. Local simplification operations are driven directly by perceptual metrics, rather than the geometric...
Hierarchical Structures For Dynamic Polygonal Simplification (1999)
This paper presents a novel technique for simplifying polygonal environments. Unlike previous multi-resolution methods, the technique operates dynamically, simplifying the scene on-the-fly as the...
View-Dependent Simplification Of Arbitrary Polygonal Environments (1998)
Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the...
View-Dependent Simplification of Arbitrary Polygonal Environments (1998)
Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the...
A Survey of Polygonal Simplification Algorithms (1998)
Polygonal simplification is at once a very current and a very old topic in computer graphics. As early as 1976 James Clark described the benefits of representing objects within a scene at several...
Polygonal simplification is at once a very current and a very old topic in computer graphics. As early as 1976 James Clark described the benefits of representing objects within a scene at several...
View-Dependent Simplification Of Arbitrary Polygonal Environments (1997)
Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the...
Hierarchical Structures For Dynamic Polygonal Simplification (1997)
This paper presents a novel technique for simplifying polygonal environments. Unlike previous multi-resolution methods, the technique operates dynamically, simplifying the scene on-the-fly as the...
A Survey of Polygonal Simplification Algorithms (1997)
Polygonal simplification is at once a very current and a very old topic in computer graphics. As early as 1976 James Clark described the benefits of representing objects within a scene at several...
Hierarchical Structures For Dynamic Polygonal Simplification (1996)
This paper presents a novel technique for simplifying polygonal environments. Unlike previous multi-resolution methods, the technique operates dynamically, simplifying the scene on-the-fly as the...