Demo Data from EDBT 2026 / reviewers in the wild / expert
Armin Pobitzer
dblp:60/9846
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2012
0000-0003-2344-5232ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author
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
1 paper |
Visualization and visual analytics · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Energy systems and smart grids · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
flow visualization |
0.1 | 1 | 2012 | Lagrangian Coherent Structures for Design Analysis of Revolving Doors · IEEE Trans. Vis. Comput. Graph. 2012 |
Visualization and visual analytics › flow visualization
lagrangian coherent structures |
0.1 | 1 | 2012 | Lagrangian Coherent Structures for Design Analysis of Revolving Doors · IEEE Trans. Vis. Comput. Graph. 2012 |
Methods — techniques the papers use, named apart from their topics
scale-space derivatives · 0.3fast fourier transform · 0.3finite-time lyapunov exponents · 0.1finite-time lyapunov exponent · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | A statistics-based dimension reduction of the space of path line attributes for interactive visual flow analysisabstractRecent work has shown the great potential of interactive flow analysis by the analysis of path lines. The choice of suitable attributes, describing the path lines, is, however, still an open question. This paper addresses this question performing a statistical analysis of the path line attribute space. In this way we are able to balance the usage of computing power and storage with the necessity to not loose relevant information. We demonstrate how a carefully chosen attribute set can improve the benefits of state-of-the art interactive flow analysis. The results obtained are compared to previously published work. Armin Pobitzer, Alan Lez, Kresimir Matkovic, Helwig Hauser |
PacificVis | 1 |
| 2012 | Lagrangian Coherent Structures for Design Analysis of Revolving DoorsabstractRoom air flow and air exchange are important aspects for the design of energy-efficient buildings. As a result, simulations are increasingly used prior to construction to achieve an energy-efficient design. We present a visual analysis of air flow generated at building entrances, which uses a combination of revolving doors and air curtains. The resulting flow pattern is challenging because of two interacting flow patterns: On the one hand, the revolving door acts as a pump, on the other hand, the air curtain creates a layer of uniformly moving warm air between the interior of the building and the revolving door. Lagrangian coherent structures (LCS), which by definition are flow barriers, are the method of choice for visualizing the separation and recirculation behavior of warm and cold air flow. The extraction of LCS is based on the finite-time Lyapunov exponent (FTLE) and makes use of a ridge definition which is consistent with the concept of weak LCS. Both FTLE computation and ridge extraction are done in a robust and efficient way by making use of the fast Fourier transform for computing scale-space derivatives. Benjamin Schindler, Raphael Fuchs, Stefan Barp, Jürgen Waser, Armin Pobitzer, Robert Carnecky, Kresimir Matkovic, Ronald Peikert |
IEEE Trans. Vis. Comput. Graph. | 5 |
| 2011 | The State of the Art in Topology-Based Visualization of Unsteady FlowabstractAbstract Vector fields are a common concept for the representation of many different kinds of flow phenomena in science and engineering. Methods based on vector field topology are known for their convenience for visualizing and analysing steady flows, but a counterpart for unsteady flows is still missing. However, a lot of good and relevant work aiming at such a solution is available. We give an overview of previous research leading towards topology‐based and topology‐inspired visualization of unsteady flow, pointing out the different approaches and methodologies involved as well as their relation to each other, taking classical (i.e. steady) vector field topology as our starting point. Particularly, we focus on Lagrangian methods, space–time domain approaches, local methods and stochastic and multifield approaches. Furthermore, we illustrate our review with practical examples for the different approaches. Armin Pobitzer, Ronald Peikert, Raphael Fuchs, Benjamin Schindler, Alexander Kuhn, Holger Theisel, Kresimir Matkovic, Helwig Hauser |
Comput. Graph. Forum | 1 |
| 2011 | Energy-scale Aware Feature Extraction for Flow VisualizationabstractAbstract In the visualization of flow simulation data, feature detectors often tend to result in overly rich response, making some sort of filtering or simplification necessary to convey meaningful images. In this paper we present an approach that builds upon a decomposition of the flow field according to dynamical importance of different scales of motion energy. Focusing on the high‐energy scales leads to a reduction of the flow field while retaining the underlying physical process. The presented method acknowledges the intrinsic structures of the flow according to its energy and therefore allows to focus on the energetically most interesting aspects of the flow. Our analysis shows that this approach can be used for methods based on both local feature extraction and particle integration and we provide a discussion of the error caused by the approximation. Finally, we illustrate the use of the proposed approach for both a local and a global feature detector and in the context of numerical flow simulations. Armin Pobitzer, Murat Tutkun, Øyvind Andreassen, Raphael Fuchs, Ronald Peikert, Helwig Hauser |
Comput. Graph. Forum | 1 |