Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Florian Ferstl

dblp:29/7528 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 8 · 6 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
5 papers
Visualization and visual analytics · 80% Computer animation and physical simulation · 11% Rendering · 6%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
scientific visualization
0.632017
Time-Hierarchical Clustering and Visualization of Weather Forecast Ensembles · IEEE Trans. Vis. Comput. Graph. 2017
Streamline Variability Plots for Characterizing the Uncertainty in Vector Field Ensembles · IEEE Trans. Vis. Comput. Graph. 2016
Interactive Separating Streak Surfaces · IEEE Trans. Vis. Comput. Graph. 2010
Visualization and visual analytics › uncertainty visualization
ensemble forecast visualization
0.312017
Time-Hierarchical Clustering and Visualization of Weather Forecast Ensembles · IEEE Trans. Vis. Comput. Graph. 2017
Visualization and visual analytics
flow visualization
0.222010
Interactive Separating Streak Surfaces · IEEE Trans. Vis. Comput. Graph. 2010
Interactive Streak Surface Visualization on the GPU · IEEE Trans. Vis. Comput. Graph. 2009
Computer animation and physical simulation › fluid simulation
liquid simulation
0.212014
Large-Scale Liquid Simulation on Adaptive Hexahedral Grids · IEEE Trans. Vis. Comput. Graph. 2014
Rendering
GPU rendering
0.112009
Interactive Streak Surface Visualization on the GPU · IEEE Trans. Vis. Comput. Graph. 2009
Visualization and visual analytics
uncertainty visualization
0.112016
Streamline Variability Plots for Characterizing the Uncertainty in Vector Field Ensembles · IEEE Trans. Vis. Comput. Graph. 2016
Visualization and visual analytics › flow visualization
lagrangian coherent structures
0.012010
Interactive Separating Streak Surfaces · IEEE Trans. Vis. Comput. Graph. 2010
Visualization and visual analytics › flow visualization
unsteady flow
0.012009
Interactive Streak Surface Visualization on the GPU · IEEE Trans. Vis. Comput. Graph. 2009

Methods — techniques the papers use, named apart from their topics

time-reversed merging · 0.3contour clustering · 0.3principal component analysis · 0.2gaussian mixture model · 0.2clustering · 0.2octree grid · 0.2nitsche method · 0.2multigrid solver · 0.2finite element method · 0.2FTLE ridge extraction · 0.1
YearPublicationVenuePosition
2017 Time-Hierarchical Clustering and Visualization of Weather Forecast Ensembles
abstract
We propose a new approach for analyzing the temporal growth of the uncertainty in ensembles of weather forecasts which are started from perturbed but similar initial conditions. As an alternative to traditional approaches in meteorology, which use juxtaposition and animation of spaghetti plots of iso-contours, we make use of contour clustering and provide means to encode forecast dynamics and spread in one single visualization. Based on a given ensemble clustering in a specified time window, we merge clusters in time-reversed order to indicate when and where forecast trajectories start to diverge. We present and compare different visualizations of the resulting time-hierarchical grouping, including space-time surfaces built by connecting cluster representatives over time, and stacked contour variability plots. We demonstrate the effectiveness of our visual encodings with forecast examples of the European Centre for Medium-Range Weather Forecasts, which convey the evolution of specific features in the data as well as the temporally increasing spatial variability.
Florian Ferstl, Mathias Kanzler, Marc Rautenhaus, Rüdiger Westermann
IEEE Trans. Vis. Comput. Graph.1
2016 Line density control in screen-space via balanced line hierarchies
Mathias Kanzler, Florian Ferstl, Rüdiger Westermann
Comput. Graph.2
2016 Narrow Band FLIP for Liquid Simulations
abstract
Abstract The Fluid Implicit Particle method (FLIP) for liquid simulations uses particles to reduce numerical dissipation and provide important visual cues for events like complex splashes and small‐scale features near the liquid surface. Unfortunately, FLIP simulations can be computationally expensive, because they require a dense sampling of particles to fill the entire liquid volume. Furthermore, the vast majority of these FLIP particles contribute nothing to the fluid's visual appearance, especially for larger volumes of liquid. We present a method that only uses FLIP particles within a narrow band of the liquid surface, while efficiently representing the remaining inner volume on a regular grid. We show that a naïve realization of this idea introduces unstable and uncontrollable energy fluctuations, and we propose a novel coupling scheme between FLIP particles and regular grid which overcomes this problem. Our method drastically reduces the particle count and simulation times while yielding results that are nearly indistinguishable from regular FLIP simulations. Our approach is easy to integrate into any existing FLIP implementation.
Florian Ferstl, Ryoichi Ando, Christopher Wojtan, Rüdiger Westermann, Nils Thürey
Comput. Graph. Forum1
2016 Visual Analysis of Spatial Variability and Global Correlations in Ensembles of Iso-Contours
abstract
Abstract For an ensemble of iso‐contours in multi‐dimensional scalar fields, we present new methods to a) visualize their dominant spatial patterns of variability, and b) to compute the conditional probability of the occurrence of a contour at one location given the occurrence at some other location. We first show how to derive a statistical model describing the contour variability, by representing the contours implicitly via signed distance functions and clustering similar functions in a reduced order space. We show that the spatial patterns of the ensemble can then be derived by analytically transforming the boundaries of a confidence interval computed from each cluster into the spatial domain. Furthermore, we introduce a mathematical basis for computing correlations between the occurrences of iso‐contours at different locations. We show that the computation of these correlations can be posed in the reduced order space as an integration problem over a region bounded by four hyper‐planes. To visualize the derived statistical properties we employ a variant of variability plots for streamlines, now including the color coding of probabilities of joint contour occurrences. We demonstrate the use of the proposed techniques for ensemble exploration in a number of 2D and 3D examples, using artificial and meteorological data sets.
Florian Ferstl, Mathias Kanzler, Marc Rautenhaus, Rüdiger Westermann
Comput. Graph. Forum1
2016 Streamline Variability Plots for Characterizing the Uncertainty in Vector Field Ensembles
abstract
We present a new method to visualize from an ensemble of flow fields the statistical properties of streamlines passing through a selected location. We use principal component analysis to transform the set of streamlines into a low-dimensional Euclidean space. In this space the streamlines are clustered into major trends, and each cluster is in turn approximated by a multivariate Gaussian distribution. This yields a probabilistic mixture model for the streamline distribution, from which confidence regions can be derived in which the streamlines are most likely to reside. This is achieved by transforming the Gaussian random distributions from the low-dimensional Euclidean space into a streamline distribution that follows the statistical model, and by visualizing confidence regions in this distribution via iso-contours. We further make use of the principal component representation to introduce a new concept of streamline-median, based on existing median concepts in multidimensional Euclidean spaces. We demonstrate the potential of our method in a number of real-world examples, and we compare our results to alternative clustering approaches for particle trajectories as well as curve boxplots.
Florian Ferstl, Kai Bürger, Rüdiger Westermann
IEEE Trans. Vis. Comput. Graph.1
2014 A Computational Tool for Preoperative Breast Augmentation Planning in Aesthetic Plastic Surgery
abstract
Breast augmentation was the most commonly performed cosmetic surgery procedure in 2011 in the United States. Although aesthetically pleasing surgical results can only be achieved if the correct breast implant is selected from a large variety of different prosthesis sizes and shapes available on the market, surgeons still rely on visual assessment and other subjective approaches for operative planning because of lacking objective evaluation tools. In this paper, we present the development of a software prototype for augmentation mammaplasty simulation solely based on 3-D surface scans, from which patient-specific finite-element models are generated in a semiautomatic process. The finite-element model is used to preoperatively simulate the expected breast shapes using physical soft-tissue mechanics. Our approach uses a novel mechanism based on so-called displacement templates, which, for a specific implant shape and position, describe the respective internal body forces. Due to a highly efficient numerical solver we can provide immediate visual feedback of the simulation results, and thus, the software prototype can be integrated smoothly into the medical workflow. The clinical value of the developed 3-D computational tool for aesthetic breast augmentation surgery planning is demonstrated in patient-specific use cases.
Joachim Georgii, Maximilian Eder, Kai Bürger, Sebastian Klotz, Florian Ferstl, Laszlo Kovacs, Rüdiger Westermann
IEEE J. Biomed. Health Informatics5
2014 Large-Scale Liquid Simulation on Adaptive Hexahedral Grids
abstract
Regular grids are attractive for numerical fluid simulations because they give rise to efficient computational kernels. However, for simulating high resolution effects in complicated domains they are only of limited suitability due to memory constraints. In this paper we present a method for liquid simulation on an adaptive octree grid using a hexahedral finite element discretization, which reduces memory requirements by coarsening the elements in the interior of the liquid body. To impose free surface boundary conditions with second order accuracy, we incorporate a particular class of Nitsche methods enforcing the Dirichlet boundary conditions for the pressure in a variational sense. We then show how to construct a multigrid hierarchy from the adaptive octree grid, so that a time efficient geometric multigrid solver can be used. To improve solver convergence, we propose a special treatment of liquid boundaries via composite finite elements at coarser scales. We demonstrate the effectiveness of our method for liquid simulations that would require hundreds of millions of simulation elements in a non-adaptive regime.
Florian Ferstl, Rüdiger Westermann, Christian Dick
IEEE Trans. Vis. Comput. Graph.1
2010 Interactive Separating Streak Surfaces
abstract
Streak surfaces are among the most important features to support 3D unsteady flow exploration, but they are also among the computationally most demanding. Furthermore, to enable a feature driven analysis of the flow, one is mainly interested in streak surfaces that show separation profiles and thus detect unstable manifolds in the flow. The computation of such separation surfaces requires to place seeding structures at the separation locations and to let the structures move correspondingly to these locations in the unsteady flow. Since only little knowledge exists about the time evolution of separating streak surfaces, at this time, an automated exploration of 3D unsteady flows using such surfaces is not feasible. Therefore, in this paper we present an interactive approach for the visual analysis of separating streak surfaces. Our method draws upon recent work on the extraction of Lagrangian coherent structures (LCS) and the real-time visualization of streak surfaces on the GPU. We propose an interactive technique for computing ridges in the finite time Lyapunov exponent (FTLE) field at each time step, and we use these ridges as seeding structures to track streak surfaces in the time-varying flow. By showing separation surfaces in combination with particle trajectories, and by letting the user interactively change seeding parameters such as particle density and position, visually guided exploration of separation profiles in 3D is provided. To the best of our knowledge, this is the first time that the reconstruction and display of semantic separable surfaces in 3D unsteady flows can be performed interactively, giving rise to new possibilities for gaining insight into complex flow phenomena.
Florian Ferstl, Kai Bürger, Holger Theisel, Rüdiger Westermann
IEEE Trans. Vis. Comput. Graph.1
2009 Interactive Streak Surface Visualization on the GPU
abstract
In this paper we present techniques for the visualization of unsteady flows using streak surfaces, which allow for the first time an adaptive integration and rendering of such surfaces in real-time. The techniques consist of two main components, which are both realized on the GPU to exploit computational and bandwidth capacities for numerical particle integration and to minimize bandwidth requirements in the rendering of the surface. In the construction stage, an adaptive surface representation is generated. Surface refinement and coarsening strategies are based on local surface properties like distortion and curvature. We compare two different methods to generate a streak surface: a) by computing a patch-based surface representation that avoids any interdependence between patches, and b) by computing a particle-based surface representation including particle connectivity, and by updating this connectivity during particle refinement and coarsening. In the rendering stage, the surface is either rendered as a set of quadrilateral surface patches using high-quality point-based approaches, or a surface triangulation is built in turn from the given particle connectivity and the resulting triangle mesh is rendered. We perform a comparative study of the proposed techniques with respect to surface quality, visual quality and performance by visualizing streak surfaces in real flows using different rendering options.
Kai Bürger, Florian Ferstl, Holger Theisel, Rüdiger Westermann
IEEE Trans. Vis. Comput. Graph.2