Wolfgang Straßer

Learn More
Simulating deformable objects based on physical laws has become the most popular technique for modeling textiles, skin, or volumetric soft objects like human tissue. The physical model leads to an ordinary differential equation. Recently, several approaches to fast algorithms have been proposed. In this work, more profound numerical background about(More)
Matching 2D range scans is a basic component of many localization and mapping algorithms. Most scan match algorithms require finding correspondences between the used features, i.e. points or lines. We propose an alternative representation for a range scan, the Normal Distributions Transform. Similar to an occupancy grid, we subdivide the 2D plane into(More)
We present a new algorithm for rendering very large volume data sets at interactive framerates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid as input. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed(More)
Interactive environments for dynamically deforming objects play an important role in surgery simulation and entertainment technology. These environments require fast deformable models and very efficient collision handling techniques. While collision detection for rigid bodies is well-investigated, collision detection for deformable objects introduces(More)
For volume rendering of regular grids the display of view-plane aligned slices has proven to yield both good quality and performance. In this paper we demonstrate how to merge the most important extensions of the original 3D slicing approach, namely the pre-integration technique, volumetric clipping, and advanced lighting. Our approach allows the(More)
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine tetrahedral meshes consume several mega-bytes of storage. For archivation and transmission compression algorithms are essential. In scientific applications lossless compression(More)
We present several improvements for compression based multi-resolution rendering of very large volume data sets at interactive to real-time frame rates on standard PC hardware. The algorithm accepts scalar or multi-variant data sampled on a regular grid as input. The input data is converted into a compressed hierarchical wavelet representation in a(More)
In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate such objects. Algorithms that measure the deviation between the approximated object and the original object are only available for special cases. In this paper we use the Hausdorff(More)
We present a parallel conjugate gradient solver for the Poisson problem optimized for multi-GPU platforms. Our approach includes a novel heuristic Poisson preconditioner well suited for massively-parallel SIMD processing. Furthermore, we address the problem of limited transfer rates over typical data channels such as the PCI-express bus relative to the(More)