Dr. rer. nat. Steffen Frey
Visualization Research Institute, University of Stuttgart

Room 00.110
Allmandring 19
70569 Stuttgart
Tel.: +49 (0)711 685-88629
Stacks Image 281
The purpose of scientific visualization is to graphically illustrate scientific data, enabling scientists to gain new insights and a deeper understanding. The size and complexity of these data sets are continuously increasing with new simulation and data acquisition methods as well as growing hardware processing power. Visualization needs to be able scale with the data, and therefore itself needs to develop new illustration techniques in conjunction with novel approaches harness the huge processing power of parallel environments.

To accomplish this goal, I develop new approaches for the efficient usage of parallel environments (in particular GPUs and clusters) as well as the illustration of the data, with the main goal being the integration of both aspects. While the emphasis is more on one or the other depending on the specific objective, neither component may be completely neglected to achieve both expressive and responsive visualization.
Stacks Image 1365
Stacks Image 1367
Sampling and Estimation of Pairwise Similarity in Spatio-Temporal Data Based on Neural Networks
S. Frey
Increasingly fast computing systems for simulations and high-accuracy measurement techniques drive the generation of time-dependent volumetric data sets with high resolution in both time and space. To gain insights from this spatio-temporal data, the computation and direct visualization of pairwise distances between time steps not only supports interactive user exploration, but also drives automatic analysis techniques like the generation of a meaningful static overview visualization, the identification of rare events, or the visual analysis of recurrent processes. However, the computation of pairwise differences between all time steps is prohibitively expensive for large-scale data not only due to the significant cost of computing expressive distance between high-resolution spatial data, but in particular owing to the large number of distance computations (O(|T|2)), with |T| being the number of time steps). Addressing this issue, we present and evaluate different strategies for the progressive computation of similarity information in a time series, as well as an approach for estimating distance information that has not been determined so far. In particular, we investigate and analyze the utility of using neural networks for estimating pairwise distances. On this basis, our approach automatically determines the sampling strategy yielding the best result in combination with trained networks for estimation.
Stacks Image 1365
Stacks Image 1367
Visualization of fracture progression in peridynamics
M. Bußler, P. Diehl, D. Pflüger, S. Frey, F. Sadlo, T. Ertl, M. A. Schweitzer
Computers & Graphics
We present a novel approach for the visualization of fracture processes in peridynamics simulations. In peridynamics simulation, materials are represented by material points linked with bonds, providing complex fracture behavior. Our approach first extracts the cracks from each time step by means of height ridge extraction. To avoid deterioration of the structures, we propose an approach to extract ridges from these data without resampling. The extracted crack geometries are then combined into a spatiotemporal structure, with special focus on temporal coherence and robustness. We then show how this structure can be used for various visualization approaches to reveal fracture dynamics, with a focus on physical mechanisms. We evaluate our approach and demonstrate its utility by means of different data sets.
Stacks Image 1365
Stacks Image 1367
Prediction of Distributed Volume Visualization Performance to Support Render Hardware Acquisition
G.Tkachev, S.Frey, C.Müller, V.Bruder, T.Ertl
Eurographics Symposium on Parallel Graphics and Visualization (EGPGV) 2017
We present our data-driven, neural network-based approach to predicting the performance of a distributed GPU volume renderer for supporting cluster equipment acquisition. On the basis of timing measurements from a single cluster as well as from individual GPUs, we are able to predict the performance gain of upgrading an existing cluster with additional or faster GPUs, or even purchasing of a new cluster with a comparable network configuration. To achieve this, we employ neural networks to capture complex performance characteristics. However, merely relying on them for the prediction would require the collection of training data on multiple clusters with different hardware, which is impractical in most cases. Therefore, we propose a two-level approach to prediction, distinguishing between node and cluster level. On the node level, we generate performance histograms on individual nodes to capture local rendering performance. These performance histograms are then used to emulate the performance of different rendering hardware for cluster-level measurement runs. Crucially, this variety allows the neural network to capture the compositing performance of a cluster separately from the rendering performance on individual nodes. Therefore, we just need a performance histogram of the GPU of interest to generate a prediction. We demonstrate the utility of our approach using different cluster configurations as well as a range of image and volume resolutions.
Stacks Image 1365
Stacks Image 1367
Stacks Image 1367
Spline-based Decomposition of Streamed Particle Trajectories for Efficient Transfer and Analysis Conversion
K. Scharnowski, S. Frey, B. Raffin, T. Ertl
EuroVis 2017, Short Paper
We introduce an approach for distributed processing and efficient storage of noisy particle trajectories, and present visual analysis techniques that directly operate on the generated representation. For efficient storage, we decompose individual trajectories into a smooth representation and a high frequency part. Our smooth representation is generated by fitting Hermite Splines to a series of time windows, adhering to a certain error bound. This directly supports scenarios involving in situ and streaming data processing. We show how the individually fitted splines can afterwards be combined into one spline posessing the same mathematical properties, i.e. C1 continuity as well as our error bound. The fitted splines are typically significantly smaller than the original data, and can therefore be used, e.g., for an online monitoring and analysis of distributed particle simulations. The high frequency part can be used to reconstruct the original data, or could also be discarded in scenarios with limited storage capabilities. Finally, we demonstrate the utility of our smooth representation for different analysis queries using real world data.
Stacks Image 1365
Stacks Image 1367
Transportation-based Visualization of Energy Conversion
O. Fernandes, S. Frey, T. Ertl
IVAPP 2017
We present a novel technique to visualize the transport of and conversion between internal and kinetic energy in compressible flow data. While the distribution of energy can be directly derived from flow state variables (e.g., velocity, pressure and temperature) for each time step individually, there is no information regarding the involved transportation and conversion processes. To visualize these, we model the energy transportation problem as a graph that can be solved by a minimum cost flow algorithm, inherently respecting energy conservation. In doing this, we explicitly consider various simulation parameters like boundary conditions and energy transport mechanisms. Based on the resulting flux, we then derive a local measure for the conversion between energy forms using the distribution of internal and kinetic energy. To examine this data, we employ different visual mapping techniques that are specifically targeted towards different research questions. In particular, we introduce glyphs for visualizing local energy transport, which we place adaptively based on conversion rates to mitigate issues due to clutter and occlusion.
Stacks Image 1040
Progressive Direct Volume-to-Volume Transformation
S. Frey, T. Ertl
TVCG (VIS 2016 paper)
We present a novel technique to generate transformations between arbitrary volumes, providing both expressive distances and smooth interpolates. In contrast to conventional morphing or warping approaches, our technique requires no user guidance, intermediate representations (like extracted features), or blending, and imposes no restrictions regarding shape or structure. Our technique operates directly on the volumetric data representation, and while linear programming approaches could solve the underlying problem optimally, their polynomial complexity makes them infeasible for high-resolution volumes. We therefore propose a progressive refinement approach designed for parallel execution that is able to quickly deliver approximate results that are iteratively improved toward the optimum. On this basis, we further present a new approach for the streaming selection of time steps in temporal data that allows for the reconstruction of the full sequence with a user-specified error bound.
Stacks Image 1365
Generative Data Models for Validation and Evaluation of Visualization Techniques
C. Schulz, Christoph and A. Nocaj, M. El-Assady, S. Frey, M. Hlawatsch, M. Hund, G. Karch, R. Netzel, C. Schätzle, M. Butt, D. Keim, T. Ertl, U. Brandes, D. Weiskopf
BELIV '16: Beyond Time And Errors: Novel Evaluation Methods For Visualization
We argue that there is a need for substantially more research on the use of generative data models in the validation and evaluation of visualization techniques. For example, user studies will require the display of representative and uncon- founded visual stimuli, while algorithms will need functional coverage and assessable benchmarks. However, data is often collected in a semi-automatic fashion or entirely hand-picked, which obscures the view of generality, impairs availability, and potentially violates privacy. There are some sub-domains of visualization that use synthetic data in the sense of genera- tive data models, whereas others work with real-world-based data sets and simulations. Depending on the visualization domain, many generative data models are “side projects” as part of an ad-hoc validation of a techniques paper and thus neither reusable nor general-purpose. We review existing work on popular data collections and generative data models in visualization to discuss the opportunities and consequences for technique validation, evaluation, and experiment design. We distill handling and future directions, and discuss how we can engineer generative data models and how visualization research could benefit from more and better use of generative data models.
Stacks Image 1805
Flow-based Temporal Selection for Interactive Volume Visualization
S. Frey, T. Ertl
Computer Graphics Forum (presented at Eurographics 2017)
We present an approach to adaptively select time steps from time-dependent volume data sets for an integrated and comprehensive visualization. This reduced set of time steps not only saves cost, but also allows to show both the spatial structure and temporal development in one combined rendering. Our selection optimizes the coverage of the complete data on the basis of a minimum-cost flow-based technique to determine meaningful distances between time steps. As both optimal solutions of the involved transport and selection problem are prohibitively expensive, we present new approaches that are significantly faster with only minor deviations. We further propose an adaptive scheme for the progressive incorporation of new time steps. An interactive volume raycaster produces an integrated rendering of the selected time steps, and their computed differences are visualized in a dedicated chart to provide additional temporal similarity information.
Stacks Image 1716
Interpolation-Based Extraction of Representative Isosurfaces
O. Fernandes, S. Frey, T. Ertl
ISVC 2016
We propose a novel technique for the automatic, similarity- based selection of representative surfaces. While our technique can be applied to any set of manifolds, we particularly focus on isosurfaces from volume data. We select representatives from sets of surfaces stemming from varying isovalues or time-dependent data. For selection, our approach interpolates between surfaces using a minimum cost flow solver, and determines whether the interpolate adequately represents the actual surface in-between. For this, we employ the Hausdorff distance as an intuitive measure of the similarity of two components. In contrast to popular contour tree-based approaches which are limited to changes in topology, our approach also accounts for geometric deviations. For interactive visualization, we employ a combination of surface renderings and a graph view that depicts the selected surfaces and their relation.
Stacks Image 1464
Partitioned Fluid-Structure-Acoustics Interaction on Distributed Data
Blom, David S.; Ertl, Thomas; Fernandes, Oliver; Frey, Steffen; Klimach, Harald; Krupp, Verena; Mehl, Miriam; Roller, Sabine; Sternel, Dörte C.; Uekermann, Benjamin; Winter, Tilo; Van Zuijlen, Alexander H.
Software for Exascale Computing - SPPEXA 2013-2015
We present a coupled simulation approach for fluid-structure-acoustic interactions as an example for strongly surface coupled multi-physics problems. In addition to the multi-physics character, FSAI feature multi-scale properties as a further challenge. In our partitioned approach, the problem is split into spatially separated subdomains interacting via coupling surfaces. Within each subdomain, scalable, single physics solvers are used to solve the respective equation systems. We run this simulation with different solvers demonstrating the performance of various solvers and the flexibility of the partitioned approach with the coupling tool preCICE. An efficient and scalable in-situ visualization reducing the amount of data in place at the simulation processors before sending them over the network or to a file system completes the simulation environment.
Stacks Image 1598
Real-Time Performance Prediction and Tuning for Interactive Volume Raycasting
V. Bruder, S. Frey, T. Ertl
SIGGRAPH ASIA 2016 Symposium on Visualization
We present an integrated approach for the real-time performance prediction and tuning of volume raycasting. The usage of empty space skipping and early ray termination, among others, can induce significant variations in performance when camera configuration and transfer functions are adjusted.
For interactive exploration, this can result in various unpleasant effects like abruptly reduced responsiveness or jerky motions. To overcome those effects, we propose an integrated approach to accelerate the rendering and assess performance-relevant data on-the-fly, including a new technique to estimate the impact of early ray termination. On this basis, we introduce a hybrid model, to achieve accurate predictions with only minimal computational footprint. Our hybrid model incorporates both aspects from analytical performance modeling and machine learning, with the goal to combine their respective strengths. Using our model, we dynamically steer the sampling density along rays with our automatic tuning technique.
Stacks Image 1477
Stacks Image 1500
Auto-Tuning Intermediate Representations for In Situ Visualization
S. Frey, T. Ertl
2016 New York Scientific Data Summit (NYSDS): Data-Driven Discovery
To optimize the generation of intermediate representations for hybrid in situ visualization, we present our approach to (1) analyze and quantify the impact of input parameters, and (2) to auto-tune them on this basis under the consideration of different constraints. We demonstrate its application and evaluate respective results at the example of Volumetric Depth Images (VDIs), a view-dependent representation for volumetric data. VDIs can quickly and flexibly be generated via a modified volume raycasting procedure that partitions and partially composits samples along view rays. In particular, we study the impact of respective input parameters on this process w.r.t. the involved quality-space trade-off. We quantify rendering quality via image quality metrics and space requirements via the compressed size of the intermediate representation. On this basis, we then automatically determine the parameter settings that yield the best quality under different constraints. We demonstrate the utility of our approach by means of a variety of different data sets, and show that we optimize the achieved results without having to rely on tedious and time-consuming manual tweaking.
Stacks Image 1222
Extraction of Fragments and Waves After Impact Damage in Particle-Based Simulations
P. Diehl, M. Bußler, D. Pflüger, S. Frey, T. Ertl, F. Sadlo, M. A. Schweitzer
Meshfree Methods for Partial Differential Equations VIII, Springer International Publishing
The analysis of simulation results with complex geometries and the verification against experimental data is essential for impact damage and wave propagation. We present two visualization techniques for post-processing particle-based simulation data and highlight new aspects for the quantitative comparison with experimental data. Peridynamics, a non-local generalization of continuum mechanics, is considered as the reference particle method. The first approach is an extended connected component algorithm to extract the fragment size and the corresponding histograms. The distribution of the fragment size is experimental verifiable with these experiments. The second approach focus on the visualization of the stress after an impact in a complex geometry. Here the particle-based data is re-sampled and rendered with standard volume rendering techniques to address the interference pat- tern of the stress wave after the reflection at the boundary.
Stacks Image 1186
Balanced Sampling and Compression for Remote Visualization
S. Frey, F. Sadlo, and T. Ertl
We present a novel approach for handling sampling and compression in remote visualization in an integrative fashion. As adaptive sampling and compression share the same underlying concepts and criteria, the times spent for visualization and transfer can be balanced directly to optimize the image quality that can be achieved within a prescribed time window. Our dynamic adjustments regarding adaptive sampling, compression, and balancing, employ regression analysis-based error estimation which is carried out individually for each image block of a visualization frame. Our approach is tuned for high parallel efficiency in GPU-based remote visualization. We demonstrate its utility within a prototypical remote volume visualization pipeline by means of different datasets and configurations.
Stacks Image 1105
Exploratory Performance Analysis and Tuning of Parallel Interactive Volume Visualization on Large Displays
A. Panagiotidis, S. Frey, and T. Ertl
EuroVis 2015, Short Paper, Cagliari, Sardinia, Italy, 2015.
In this paper, we present an integrated approach for exploratory performance analysis and parameter optimization of interactive distributed volume visualization for large displays. We collect performance metrics of interest on-the-fly directly from both the GPU and our volume ray casting implementation and visualize them simultaneously. This allows users to explore the data set together with the corresponding metrics to jointly investigate both the visual and the performance impact of different parameter settings, like camera position, sampling density, or acceleration technique.
Stacks Image 1031
On In-Situ Visualization for Strongly Coupled Partitioned Fluid-Structure Interaction
O. Fernandes, D.. Blom, S. Frey, A. V. Zuijlen, H. Bijl, and T. Ertl
We present an integrated in-situ visualization approach for partitioned multi-physics simulation of fluid-structure interaction. The simulation itself is treated as a black box and only the information at the fluid-structure interface is considered, and communicated between the fluid and solid solvers with a separate coupling tool.
Stacks Image 1487
Interactive Progressive Visualization with Space-Time Error Control
S. Frey, F. Sadlo, K.-L. Ma, and T. Ertl
Static settings with respect to a certain image quality or frame rate are inherently incapable of delivering both high frame rate for rapid changes and high image quality for detailed investigation. Our technique flexibly adapts by steering the visualization process in three major degrees of freedom: when to terminate the
refinement of a frame in the background and start a new one, when to display a frame currently computed, and how much resources to consume. We base these decisions on the correlation of the errors due to insufficient sampling and response delay, which we estimate separately using fast yet expressive heuristics.
Stacks Image 132
Space-Time Volumetric Depth Images for In-Situ Visualization
O. Fernandes, S. Frey, F. Sadlo, and T. Ertl
Volumetric depth images (VDI) are a view-dependent representation that combines the high quality of images with the explorability of 3D fields. By compressing the scalar data along view rays into sets of coherent supersegments, VDIs provide an efficient representation that supports a-posteriori changes of camera parameters. In this paper, we introduce space-time VDIs that achieve the data reduction that is required for efficient in-situ
visualization, while still maintaining spatiotemporal flexibility.
Stacks Image 1570
Explorable Volumetric Depth Images from Raycasting
S. Frey, F. Sadlo, and T. Ertl
View-dependent image-based rendering techniques have become increasingly popular as they combine the high quality of images with the explorability of interactive techniques. However, in the context of volume rendering, previous approaches suffer from various shortcomings, including the limitation to surfaces, expensive generation, and insufficient occlusion and motion parallax impairing depth perception. In this paper, we propose Volumetric Depth Images (VDI) to overcome these issues for view-dependent volume visualization by an extension of the Layered Depth Image (LDI) approach. Instead of only saving for each view ray of one camera configuration the depth and color values for a set of surfaces, as in LDIs, VDIs store so- called supersegments, each consisting of a depth range as well as composited color and opacity.
Stacks Image 1653
Mesh Generation From Layered Depth Images Using Isosurface Raycasting
S. Frey, F. Sadlo, and T. Ertl
This paper presents an approach for the fast generation of meshes from Layered Depth Images (LDI), a representation that is inde- pendent of the underlying data structure and widely used in image-based rendering. LDIs can be quickly generated from high-quality, yet compu- tationally expensive isosurface raycasters that are available for a wide range of different types of data. We propose a fast technique to extract meshes from one or several LDIs which can then be rendered for fast, yet high-quality analysis with comparatively low hardware requirements. To further improve quality, we also investigate mesh geometry merging and adaptive refinement, both for triangle and quad meshes.
Stacks Image 1079
Parallel Interactive Visualization: Strategies and Examples
S. Frey and T. Ertl
Interaction and HPC: Multi-Scale / Multi-Physics Applications, ParCo 2013, Munich, Germany, 2013. (Talk Only)
Scientific visualization applications typically exhibit a common structure and share a number of characteristic properties and requirements in the context of parallel computation. We outline these aspects by means of several applications from our scientific visualization research. We further show that, despite these shared commonalities, there exists a variety of significantly different approaches to improve the responsiveness in the context of parallel and distributed hardware architectures. This is exemplified by means of several of our visualization research projects.
Stacks Image 957
Visualization of Temporal Similarity in Field Data
S. Frey, F. Sadlo and T. Ertl
Large parts of science and engineering deal with time-dependent phenomena. We present an interactive visualization approach for detecting and exploring similarity in the temporal variation of field data. It allows the investigation of periodic and quasi-periodic behavior at single points as well as similarity between different locations within a field or between different data sets.
Stacks Image 1155
SIMT Microscheduling: Reducing Thread Stalling in Divergent Iterative Algorithms
S. Frey, G. Reina and T. Ertl
Current GPUs execute group of threads (warps) in lockstep. This potential leads to a large amount of wasted cycles for divergent control flow. To overcome this issue, we propose techniques to relax divergence on the fly within a computation kernel to achieve a much higher utilization of processing cores.
Stacks Image 1238
GPU-Accelerated Visualization
Ament, Marco; Frey, Steffen; Müller, Christoph; Grottel, Sebastian; Ertl, Thomas; Weiskopf, Daniel
In Book: E. W. Bethel, H. Childs, and C. Hansen: High Performance Visualization: Enabling Extreme-Scale Scientific Insight. Chapman and Hall/CRC (2012).
The book explores several distinct but interrelated approaches to high performance visualization. In my section, I give an overview on programming frameworks for GPU clusters with focus on visualization.
Stacks Image 739
Loose Capacity-Constrained Representatives for the Qualitative Visual Analysis in Molecular Dynamics
S. Frey, T. Schlömer, S. Grottel, C. Dachsbacher, O. Deussen and T. Ertl
The increasing extents of the spatial and temporal domain of molecular dynamics simulations pose a particular challenge for the visualization. Our technique replaces the huge amount of simulated particles by a smaller set of representatives that capture the characteristics of the underlying particle density and exhibit coherency over time.
Stacks Image 929
Load Balancing Utilizing Data Redundancy in Distributed Volume Rendering
S. Frey and T. Ertl
In distributed volume rendering, the cost for rendering different blocks of the volumes strongly varies with the camera configuration. Traditional load-balancing induces expensive data transfers. Our technique stores volume blocks redundantly, allowing our scheduler to evenly balance the load with almost no overhead.
Stacks Image 445
GPU-based 2D Flow Simulation Steering using Coherent Structures
M. Ament, S. Frey, F. Sadlo, T. Ertl and D. Weiskopf
The interactive investigation of CFD flow can both allow to achieve a desired flow behavior faster and supports the understanding of underlying mechanisms. We propose a CUDA-based steering system that allows interactive manipulation of boundary conditions such as obstacles or velocity profiles.
Stacks Image 1404
DIANA: A Device Abstraction Framework for Parallel Computations
A. Panagiotidis, D. Kauker, S. Frey, T. Ertl
There is a multitude of different APIs, SDKs and libraries for programming different many-core devices. DIANA provides a common interface to hide the complexity of managing them, allowing for easier maintainability, higher flexibility and improved portability.
Stacks Image 697
Interactive High-Quality Visualization of Higher-Order Finite Elements
M. Üffinger, S. Frey, and T. Ertl
Eurographics 2010 (EG'10), Norköpping, Sweden, 2010.
Higher-order finite element methods produce complex grids which feature non-convex, curvilinear cells with varying polynomial degree. We introduce a distributed GPU-based ray casting system employing both adaptive sampling and load-balancing for achieving interactive frame rates.
Stacks Image 655
Memory Saving Fourier Transform on GPUs
D. Kauker, H. Sanftmann, S. Frey, and T. Ertl
Current GPU Fourier transform libraries need a large buffer for storing intermediate results, severely limiting the size of an image that can be processed for instance. Our alternative two-dimensional Discrete Fourier Transform method computes the same output with far less memory by exploiting the separability property.
Stacks Image 1321
PaTraCo: A Framework Enabling the Transparent and Efficient Programming of Heterogeneous Compute Networks
S. Frey and T. Ertl
In particular ad-hoc compute networks are typically heterogeneous, e.g. different classes of compute devices at different speeds suited for different kinds of tasks, varying network bandwidth). We propose a framework with a built-in scheduler that explicitly considers these characteristics and handles them transparently for the user.
Stacks Image 529
Accelerating Raycasting Utilizing Volume Segmentation of Industrial CT Data
S. Frey and T. Ertl
Raycasting large CT volumes interactively is still computationally demanding. Utilizing the segmentation information that is typically employed for object analysis, GPU ray casting can be accelerated significantly using a novel data structure that is integrated into the volume, requiring no extra texture lookups.
Stacks Image 927
Concurrent CT Reconstruction and Visual Analysis Using Hybrid Multi-resolution Raycasting in a Cluster Environment
S. Frey, C. Müller, M. Strengert, and T. Ertl
Preparing the data for analysis after the CT scanning of an object takes a considerable amount of time. Our distributed program architecture leverages all resources of a GPU cluster for the incremental reconstruction, segmentation and rendering, provide the user with continuously updated provisional results.
Stacks Image 781
CUDA-Accelerated Continuous 2-D Scatterplots
S. Bachthaler, S. Frey and D. Weiskopf
IEEE Visualization 2009 (VIS'09), Poster, Atlantic City, USA, 2009.
Continuous scatterplots represent a continous distribution function in a dense way in the scatterplot domain. We significantly speed up the original CPU approach with our GPU implementation to allow for interactive exploration.
Stacks Image 311
A Compute Unified System Architecture for Graphics Clusters Incorporating Data-Locality
C. Müller, S. Frey, M. Strengert, C. Dachsbacher and T. Ertl
CUDA is a parallel computing architecture for graphics cards. CUDASA logically extends its programming model and API for multi-GPU systems and distributed GPU computing. It includes an automatic GPU-accelerated scheduling mechanism that is aware of data locality to optimize GPU utilization.
  • Program Committee Member, EuroVIS Short Papers, 2017.
  • Program Committee Member, ISC, 2017.
  • Chair, ISC Workshop on In Situ Visualization, 2016.
  • Program Committee Member, Symposium on Large Data Analysis and Visualization (LDAV), 2016.
  • Program Committee Member, SIGGRAPH ASIA 2016 Symposium on Visualization, 2016.
  • Program Committee Member, International Symposium on Visual Computing (ISVC), 2016.
Advised Student Bachelor/Master/Diploma Theses
  • Performance Quantification of Volume Visualization, Valentin Bruder, 2015/16.
  • Real-time Ray Tracing of Volumetric Data, Marcus Richter, 2015/16.
  • Dynamic Acceleration Structures for the Visualization of Time-Dependent Volume Data on the GPU, Hajun Jang, 2014/15.
  • Adaptive Frameless Raycasting for Interactive Volume Visualization, Constantin Weisser, 2014.
  • Extraction of High Quality Isosurfaces from Large Volume Data, Thomas Mezger, 2012/13.
  • Distributed Raytracing on GPU Clusters, Jochen Puff, 2010.
  • Algorithm Design and Algorithmic-Level Optimization of Video / Image Algorithm using an Abstract Common Interface for NVIDIA CUDA and Intel Larrabee Platforms, Daniel Kauker, 2009/2010.
  • Parallel Computation of Volumetric Illumination of Astrophysical Nebulae on GPU Clusters, Manuel Moser, 2009/2010.
  • Hauptseminar Advanced Visualization Techniques, 2012/13
  • Hauptseminar Volume Rendering, 2011/12
  • Seminar Interactive Visualization Techniques, 2011
  • Hauptseminar Volume Rendering, 2010
  • Lecture Assignments Visual Computing, 2009/10
  • Lecture Assignments Image Synthesis/Rendering, 2009
  • Lecture Assignments Visual Computing, 2008/09
  • Graphics and GPU programming lab, 2008/09
Stacks Image 843
GPU-basierte Kegelstrahlrekonstruktion großer CT Datensätze
Advisiors: Magnus Strengert (VISUS), Rolf Schaller (Daimler AG)
CT reconstruction plays an important role in industrial material testing and quality control. However, this process step can take considerable time, thus delaying the overall workflow.
The work introduces and evaluates several approaches for accelerating the Feldkamp CT reconstruction algorithm using a GPU.
Stacks Image 881
Depth Peeling in OpenSceneGraph
Depth peeling extracts 2D layers of 3D geometry in depth-sorted order. I implemented this technique as final project for the Graphics and GPU programming lab. I also added some sketchy drawing outline modes to generate the look of hand-drawn sketches. It was submitted to the OpenSceneGraph project and is contained in the package as the osgdepthpeeeling example.
Stacks Image 36
Webservice-Based Remote Rendering
I was working on a web-based service for rendering medical volumetric data sets as a research assistant of Friedemann Rößler at the VIS .
Stacks Image 915
Extending a Multimedia Engine for 3d madness GmbH
3d madness is a multimedia studio, with focus on the 3D Visualization of products, buildings and data as well ass virtual reality amongst others. I was working on making a powerful open source multimedia engine (Delta3D) accessible for the 3D modelers and designers as well as integrating effects (e.g. shadows) according to their needs.