Daniel E. Laney

Learn More
The SQuad data structure represents the connectivity of a triangle mesh by its “S table” of about 2 rpt (integer references per triangle). Yet it allows for a simple implementation of expected constant-time, random-access operators for traversing the mesh, including in-order traversal of the triangles incident upon a vertex. SQuad is more compact than the(More)
We present a distributed framework that enables real-time streaming and visualization of data generated by large remote simulations. We address issues arising from distributed clientserver environments and guarantee good parallel load balancing. We apply progressive computing techniques and parallel, hierarchical data streaming techniques to reduce the(More)
We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topology and arbitrary numbers of components within a single multiresolution data structure. This data structure elegantly handles topological modification at high compression rates. Our(More)
This paper examines whether lossy compression can be used effectively in physics simulations as a possible strategy to combat the expected data-movement bottleneck in future high performance computing architectures. We show that, for the codes and simulations we tested, compression levels of 3--5X can be applied without causing significant changes to(More)
Interactive visualization and exploration of large-scale scientific data sets is an important application for the analysis of data obtained from computational fluid dynamics (CFD), computerized tomography (CT), and laserrange scans. These data sets are typically defined by discrete samples, either aligned on regular grids or randomly scattered in space,(More)
We present a new wavelet compression and multiresolution modeling approach for sets of contours (level sets). In contrast to previous wavelet schemes, our algorithm creates a parametrization of a scalar field induced by its contours and compactly stores this parametrization rather than function values sampled on a regular grid. Our representation is based(More)
We present the application of hardware accelerated volume rendering algorithms to the simulation of radiographs as an aid to scientists designing experiments, validating simulation codes, and understanding experimental data. The techniques presented take advantage of 32-bit floating point texture capabilities to obtain solutions to the radiative transport(More)
We present an adaptive signed distance transform algorithm for curves in the plane. A hierarchy of bounding boxes is required for the input curves. We demonstrate the algorithm on the isocontours of a turbulence simulation. The algorithm provides guaranteed error bounds with a selective refinement approach. The domain over which the signed distance function(More)
Gerd Fabio Patrick Kevin Leonard Allen Michael Meissner Benjamin Mora Patrick Moran Christopher Morris Lukas Wolfgang Klaus Luciana Nedel Neophytos Neophytou Erwin Oertli Silvia Olabarriaga Marc Olano Arthur Olson Renato Pajarola Alex Pang Michael Papka Park Pascucci Giuseppe Joseph Federico Ponchio Voicu Popescu Bernhard Preim Gerd Christof Rezk Salama(More)
We present a progressive compression technique for volumetric subdivision meshes based on the slow growing refinement algorithm. The system is comprised of a wavelet transform followed by a progressive encoding of the resulting wavelet coefficients. We compare the efficiency of two wavelet transforms. The first transform is based on the smoothing rules used(More)
  • 1