Demo Data from VLDB 2026 / reviewers in the wild / expert
Irene Baeza Rojo
dblp:223/7507
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2020
0000-0002-3858-6612ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 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
3 papers |
Visualization and visual analytics · 60% Rendering · 40% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
flow visualization |
0.9 | 2 | 2020 | Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents · IEEE Trans. Vis. Comput. Graph. 2020 Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame · IEEE Trans. Vis. Comput. Graph. 2020 |
Visualization and visual analytics › flow visualization › lagrangian coherent structures
finite-time lyapunov exponent |
0.4 | 1 | 2020 | Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents · IEEE Trans. Vis. Comput. Graph. 2020 |
Visualization and visual analytics › flow visualization
lagrangian coherent structures |
0.4 | 1 | 2020 | Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents · IEEE Trans. Vis. Comput. Graph. 2020 |
Visualization and visual analytics › information visualization
large-scale data visualization |
0.4 | 1 | 2020 | Fourier Opacity Optimization for Scalable Exploration · IEEE Trans. Vis. Comput. Graph. 2020 |
Rendering
monte carlo rendering |
0.4 | 1 | 2020 | Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents · IEEE Trans. Vis. Comput. Graph. 2020 |
Rendering › surface rendering › transparency rendering
order-independent transparency |
0.4 | 1 | 2020 | Fourier Opacity Optimization for Scalable Exploration · IEEE Trans. Vis. Comput. Graph. 2020 |
Rendering › surface rendering
transparency rendering |
0.4 | 1 | 2020 | Fourier Opacity Optimization for Scalable Exploration · IEEE Trans. Vis. Comput. Graph. 2020 |
Visualization and visual analytics › topological data analysis
vector field topology |
0.4 | 1 | 2020 | Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame · IEEE Trans. Vis. Comput. Graph. 2020 |
Rendering
volume rendering |
0.4 | 1 | 2020 | Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents · IEEE Trans. Vis. Comput. Graph. 2020 |
Methods — techniques the papers use, named apart from their topics
vortex extraction · 0.4transmittance estimation · 0.4opacity optimization · 0.4local optimization · 0.4gradient-domain rendering · 0.4fourier basis approximation · 0.4displacement transformations · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Vector Field Topology of Time-Dependent Flows in a Steady Reference FrameabstractThe topological analysis of unsteady vector fields remains to this day one of the largest challenges in flow visualization. We build up on recent work on vortex extraction to define a time-dependent vector field topology for 2D and 3D flows. In our work, we split the vector field into two components: a vector field in which the flow becomes steady, and the remaining ambient flow that describes the motion of topological elements (such as sinks, sources and saddles) and feature curves (vortex corelines and bifurcation lines). To this end, we expand on recent local optimization approaches by modeling spatially-varying deformations through displacement transformations from continuum mechanics. We compare and discuss the relationships with existing local and integration-based topology extraction methods, showing for instance that separatrices seeded from saddles in the optimal frame align with the integration-based streakline vector field topology. In contrast to the streakline-based approach, our method gives a complete picture of the topology for every time slice, including the steps near the temporal domain boundaries. With our work it now becomes possible to extract topological information even when only few time slices are available. We demonstrate the method in several analytical and numerically-simulated flows and discuss practical aspects, limitations and opportunities for future work. Irene Baeza Rojo, Tobias Günther |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2020 | Accelerated Monte Carlo Rendering of Finite-Time Lyapunov ExponentsabstractTime-dependent fluid flows often contain numerous hyperbolic Lagrangian coherent structures, which act as transport barriers that guide the advection. The finite-time Lyapunov exponent is a commonly-used approximation to locate these repelling or attracting structures. Especially on large numerical simulations, the FTLE ridges can become arbitrarily sharp and very complex. Thus, the discrete sampling onto a grid for a subsequent direct volume rendering is likely to miss sharp ridges in the visualization. For this reason, an unbiased Monte Carlo-based rendering approach was recently proposed that treats the FTLE field as participating medium with single scattering. This method constructs a ground truth rendering without discretization, but it is prohibitively slow with render times in the order of days or weeks for a single image. In this paper, we accelerate the rendering process significantly, which allows us to compute video sequence of high-resolution FTLE animations in a much more reasonable time frame. For this, we follow two orthogonal approaches to improve on the rendering process: the volumetric light path integration in gradient domain and an acceleration of the transmittance estimation. We analyze the convergence and performance of the proposed method and demonstrate the approach by rendering complex FTLE fields in several 3D vector fields. Irene Baeza Rojo, Markus Gross 0001, Tobias Günther |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2020 | Fourier Opacity Optimization for Scalable ExplorationabstractOver the past decades, scientific visualization became a fundamental aspect of modern scientific data analysis. Across all data-intensive research fields, ranging from structural biology to cosmology, data sizes increase rapidly. Dealing with the growing large-scale data is one of the top research challenges of this century. For the visual exploratory data analysis, interactivity, a view-dependent visibility optimization and frame coherence are indispensable. In this work, we extend the recent decoupled opacity optimization framework to enable a navigation without occlusion of important features through large geometric data. By expressing the accumulation of importance and optical depth in Fourier basis, the computation, evaluation and rendering of optimized transparent geometry become not only order-independent, but also operate within a fixed memory bound. We study the quality of our Fourier approximation in terms of accuracy, memory requirements and efficiency for both the opacity computation, as well as the order-independent compositing. We apply the method to different point, line and surface data sets originating from various research fields, including meteorology, health science, astrophysics and organic chemistry. Irene Baeza Rojo, Markus Gross 0001, Tobias Günther |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2018 | Visualizing the Phase Space of Heterogeneous Inertial Particles in 2D FlowsabstractAbstract In many scientific disciplines, the motion of finite‐sized objects in fluid flows plays an important role, such as in brownout engineering, sediment transport, oceanology or meteorology. These finite‐sized objects are called inertial particles and, in contrast to traditional tracer particles, their motion depends on their current position, their own particle velocity, the time and their size. Thus, the visualization of their motion becomes a high‐dimensional problem that entails computational and perceptual challenges. So far, no visualization explored and visualized the particle trajectories under variation of all seeding parameters. In this paper, we propose three coordinated views that visualize the different aspects of the high‐dimensional space in which the particles live. We visualize the evolution of particles over time, showing that particles travel different distances in the same time, depending on their size. The second view provides a clear illustration of the trajectories of different particle sizes and allows the user to easily identify differences due to particle size. Finally, we embed the trajectories in the space‐velocity domain and visualize their distance to an attracting manifold using ribbons. In all views, we support interactive linking and brushing, and provide abstraction through density volumes that are shown by direct volume rendering and isosurface slabs. Using our method, users gain deeper insights into the dynamics of inertial particles in 2D fluids, including size‐dependent separation, preferential clustering and attraction. We demonstrate the effectiveness of our method in multiple steady and unsteady 2D flows. Irene Baeza Rojo, Markus Gross 0001, Tobias Günther |
Comput. Graph. Forum | 1 |