External facelist calculation on three-dimensional unstructured meshes is used in scientific visualization libraries to efficiently render the results of operations such as clipping, interval volumes, and material boundaries. ...

In this talk, I will give an overview of one-dimensional Linear Transport Theory, which concerns itself with the study of random scattering and absorption processes and the inference of large-scale behavior from simple ...

We present a novel algorithm for the efficient extraction and visualization of high-quality ridge and valley surfaces from numerical datasets. Despite their rapidly increasing popularity in visualization, these so-called ...

We propose a new framework for the simulation of facial muscle and flesh that so significantly improves the technique that it allows for immediate mainstream use of anatomically and biomechanically accurate muscle models ...

Space filling curves, invented by mathematicians in the 19th century, have long been a fascination for artists, however there are no interactive tools to allow an artist to create and explore various levels of recursion ...

Supercomputing designs have recently evolved to include architectures beyond the standard CPU. In response, visualization software must be developed in a manner that obviates the need for porting all visualization algorithms ...

We introduce a novel approach to image-space ray tracing ideally suited for the photorealistic synthesis of fully dynamic environments at interactive frame rates. Our method, designed entirely on the rasterization pipeline, ...

We present PixelPie, a highly parallel geometric formulation of the Poisson-disk sampling problem on the graphics pipeline. Traditionally, generating a distribution by throwing darts and removing conflicts has been viewed ...

Time-dependent volumetric data has important applications in areas as diverse as medicine, climatology, and engineering. However, the simultaneous quantitative assessment of spatial and temporal features is very challenging. ...

The memory footprint of bounding volume hierarchies (BVHs) can be significantly reduced using incremental encoding, which enables the coarse quantization of bounding volumes. However, this compression alone does not ...