Tino Weinkauf’s research while affiliated with KTH Royal Institute of Technology and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (106)


Interactive Reward Tuning: Interactive Visualization for Preference Elicitation
  • Conference Paper

October 2024

·

5 Reads

Danqing Shi

·

Shibei Zhu

·

Tino Weinkauf

·



Figure 1: The function from Equation (6) has been sampled on different types of grids and the Morse-Smale complex has been extracted using different methods. The goal of accurate geometry is to achieve a geometric embedding that is similar to the one from continuous topology. While it is well-known that the steepest descent method is not able to achieve this on uniform grids, we show that it can achieve accurate geometry on certain grid types and provide a suggestion of how to convert uniform grids accordingly.
Figure 8: Different grid types as used in this paper.
Figure 10: The discrete Morse-Smale complex obtained using the steepest descent method applied to our suggested triangle grid in comparison to the continuous Morse-Smale complex. The latter has a slightly different handling of the cases at the boundary, but otherwise the topologies coincide. Compare these results to Figure 5.
Revisiting Accurate Geometry for Morse-Smale Complexes
  • Preprint
  • File available

September 2024

·

23 Reads

The Morse-Smale complex is a standard tool in visual data analysis. The classic definition is based on a continuous view of the gradient of a scalar function where its zeros are the critical points. These points are connected via gradient curves and surfaces emanating from saddle points, known as separatrices. In a discrete setting, the Morse-Smale complex is commonly extracted by constructing a combinatorial gradient assuming the steepest descent direction. Previous works have shown that this method results in a geometric embedding of the separatrices that can be fundamentally different from those in the continuous case. To achieve a similar embedding, different approaches for constructing a combinatorial gradient were proposed. In this paper, we show that these approaches generate a different topology, i.e., the connectivity between critical points changes. Additionally, we demonstrate that the steepest descent method can compute topologically and geometrically accurate Morse-Smale complexes when applied to certain types of grids. Based on these observations, we suggest a method to attain both geometric and topological accuracy for the Morse-Smale complex of data sampled on a uniform grid.

Download



In-Situ Analysis of Backflow Events and Their Relation to Separation in Wings Through Well-Resolved LES

November 2023

·

29 Reads

Wall-bounded turbulent flows as those occurring in transportation (e.g. aviation) or industrial applications (e.g turbomachinery), are usually subjected to pressure gradients (PGs). The presence of such PGs affects greatly the development and physics of the turbulent boundary layer (TBL), making it an open research area. An important phenomena associated with the presence of strong adverse PGs (APGs) as appearing in wings, is the separation of the boundary layer, which can lead to stall.




Temporal Merge Tree Maps:A Topology-Based Static Visualization for Temporal Scalar Data

September 2022

·

25 Reads

·

3 Citations

IEEE Transactions on Visualization and Computer Graphics

Creating a static visualization for a time-dependent scalar field is a non-trivial task, yet very insightful as it shows the dynamics in one picture. Existing approaches are based on a linearization of the domain or on feature tracking. Domain linearizations use space-filling curves to place all sample points into a 1D domain, thereby breaking up individual features. Feature tracking methods explicitly respect feature continuity in space and time, but generally neglect the data context in which those features live. We present a feature-based linearization of the spatial domain that keeps features together and preserves their context by involving all data samples. We use augmented merge trees to linearize the domain and show that our linearized function has the same merge tree as the original data. A greedy optimization scheme aligns the trees over time providing temporal continuity. This leads to a static 2D visualization with one temporal dimension, and all spatial dimensions compressed into one. We compare our method against other domain linearizations as well as feature-tracking approaches, and apply it to several real-world data sets.


In-situ visualization of large-scale turbulence simulations in Nek5000 with ParaView Catalyst

February 2022

·

685 Reads

·

10 Citations

The Journal of Supercomputing

In-situ visualization on high-performance computing (HPC) systems allows us to analyze simulation results that would otherwise be impossible , given the size of the simulation data sets and offline post-processing execution time. We develop an in-situ adaptor for Paraview Catalyst and Nek5000, a massively parallel Fortran and C code for computational fluid dynamics (CFD). We perform a strong scalability test up to 2, 048 cores on KTH's Beskow Cray XC40 supercomputer and assess in-situ visualization's impact on the Nek5000 performance. In our study case, a high-fidelity simulation of turbulent flow, we observe that in-situ operations significantly limit the strong scalability of the code, reducing the relative parallel efficiency to only ≈ 21% on 2,048 cores (the relative efficiency of Nek5000 without in-situ operations is ≈ 99%). Through profiling with Arm MAP, we identified a bottleneck in the image composition step (that uses the Radix-kr algorithm) where a majority of the time is spent on MPI communication. We also identified an imbalance of in-situ processing time between rank 0 and all other ranks. In our case, better scaling and load-balancing in the parallel image composition would considerably improve the performance of Nek5000 with in-situ capabilities. In general, the result of this study highlights the technical challenges posed by the integration of high-performance simulation codes and data-analysis libraries and 2 Marco Atzori et al. their practical use in complex cases, even when efficient algorithms already exist for a certain application scenario.


Citations (82)


... Among the four AI-creators, Sportify [25] and AiCommentator [1] leverage AI-creators to communicate automatically identified data insights in sports games to humans. Ying et al. [67] and Shi et al. [46] support chart and dataset understanding with AI-creators who communicate insights to humans with animations and narrations. Comparing these cases with the interview study, we can notice that the AI-creator communicates AI-created stories in these tools rather than presenting human-created stories as their proxies. ...

Reference:

Reflection on Data Storytelling Tools in the Generative AI Era from the Human-AI Collaboration Perspective
Understanding and Automating Graphical Annotations on Animated Scatterplots
  • Citing Conference Paper
  • April 2024

... Multi-GPU HPC nodes have become omnipresent in largescale supercomputers to support a variety of accelerated scientific workloads, ranging from weather forecast [2], computational fluid dynamics [3], [4], molecular dynamics [5], plasma simulation [6], and quantum computer simulators [7]. Currently, large-scale HPC clusters exhibit computing nodes with multiple GPUs on the same node, interconnected via a high-performance interconnect or through PCIe. ...

Exploring the Ultimate Regime of Turbulent Rayleigh–Bénard Convection Through Unprecedented Spectral-Element Simulations
  • Citing Conference Paper
  • November 2023

... Specifically, our framework augments any lossy compressor in order to preserve the contour tree in terms of its critical points and the connectivity among those critical points. Preserving the contour tree of the reconstructed data is crucial to support a variety of post hoc scientific visualization tasks, since the contour tree has been used for feature extraction, tracking, comparison, and interactive contour exploration (e.g., [27,64]). ...

Temporal Merge Tree Maps:A Topology-Based Static Visualization for Temporal Scalar Data
  • Citing Article
  • September 2022

IEEE Transactions on Visualization and Computer Graphics

... For current HPC systems, this gap due to the limitations in the data input/output (I/O) can be as large as up to four orders of magnitudes, even for highly parallel systems [14]. To overcome this limitation, workflows for in-situ visualizations have been set up to export compressed pictures of the flow field during runtime, see [15] for an in-situ visualization workflow with Nek5000 [16]. A common technique to visualize turbulence are iso-surfaces of the so-called Q-criterion exported for each time-step, which can later be integrated into a video. ...

In-situ visualization of large-scale turbulence simulations in Nek5000 with ParaView Catalyst

The Journal of Supercomputing

... The topological skeleton consisting of first order critical points and the invariant manifolds of saddles have been visualized for a long time [15]. Many extensions to 3D [12], higher order critical points [34], [36], [50], boundary switch points [10], [35], periodic orbits [51], [52], discrete topology [7], [20], [30], [40], and time-dependent flow [4], [29] have been suggested in the literature. Fig. 1: The different types of first order non-degenerate 2D critical points visualized with line integral convolution (LIC) [5] and arrow glyphs. ...

Extracting Higher Order Critical Points and Topological Simplification of 3D Vector Fields
  • Citing Conference Paper
  • January 2005

... Experimental studies have shown that suction leads to a decrease in skin friction on an aerofoil (Braslow et al. 1951;Hwang 1997), which would improve a plane's fuel efficiency by reducing the drag on its wings. More recent studies (Koepp et al. 2020) have used sophisticated numerical simulations and found similar results. Other applications include cooling a turbine's blades (Zhou et al. 2019) and reducing drag due to wind on high-rise buildings (Zheng & Zhang 2012). ...

Video: Effects of Blowing and Suction on the Turbulent Flow around an Airfoil
  • Citing Conference Paper
  • November 2020

... Such methods exploit transparency, or the selection of relevant lines [Gün20]. While some flow visualization approaches [PWK20] are adapted to visualize the dMRI data, they do not fit the brain tractograms constraints. Streamline methods [LS07] generate representative streamlines, but any approximation or representation that is not medically justified should be avoided in our context. ...

A Discrete Probabilistic Approach to Dense Flow Visualization
  • Citing Article
  • July 2020

IEEE Transactions on Visualization and Computer Graphics

... A related topological approach, Percolation theory, studies the connectivity of an infinite network in terms of the size and extent of the largest connected component, as vertices or edges are included/excluded from the network [2,8]. A discontinuity in the resulting percolation function provides a threshold that describes an intrinsic porosity property of the material [27]. It has been adapted to finite domains and large material images [14]. ...

Notes on Percolation Analysis of Sampled Scalar Fields
  • Citing Chapter
  • June 2019

... In Section 2, we detail the three layout-related metrics that we subsequently calculated in our study from the labeled UIs: Balance, Equilibrium and Symmetry. In Section 3, we describe the experimental study with 368 web UI screenshots, 177 human participants and 2 computer visionbased web designs analysis services: VA [6] and AIM [8]. In Section 4, we present the regression models built with the collected experimental data, benchmark their quality and analyze the effects of the factors. ...

Aalto Interface Metrics (AIM): A Service and Codebase for Computational GUI Evaluation
  • Citing Conference Paper
  • October 2018