VLDB 2026 Research / reviewers in the wild / expert
Tobias Rapp
dblp:238/4004
· DBLP profile ↗
5ranked-venue papers
3as first author
3since 2021 · last 2022
0000-0002-5436-5553ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author · 3 since 2021
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 · 63% Rendering · 16% Geometric modeling and processing · 12% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering
volume rendering |
0.6 | 1 | 2022 | Image-based Visualization of Large Volumetric Data Using Moments · IEEE Trans. Vis. Comput. Graph. 2022 |
Visualization and visual analytics
volume visualization |
0.6 | 1 | 2022 | Image-based Visualization of Large Volumetric Data Using Moments · IEEE Trans. Vis. Comput. Graph. 2022 |
Visualization and visual analytics
clustering |
0.5 | 1 | 2021 | Visual Analysis of Large Multivariate Scattered Data using Clustering and Probabilistic Summaries · IEEE Trans. Vis. Comput. Graph. 2021 |
Visualization and visual analytics
multivariate data visualization |
0.5 | 1 | 2021 | Visual Analysis of Large Multivariate Scattered Data using Clustering and Probabilistic Summaries · IEEE Trans. Vis. Comput. Graph. 2021 |
Visualization and visual analytics
data reduction |
0.4 | 1 | 2020 | Void-and-Cluster Sampling of Large Scattered Data and Trajectories · IEEE Trans. Vis. Comput. Graph. 2020 |
Geometric modeling and processing › shape representation › multiresolution shape representation
level-of-detail representation |
0.4 | 1 | 2020 | Void-and-Cluster Sampling of Large Scattered Data and Trajectories · IEEE Trans. Vis. Comput. Graph. 2020 |
Image and video coding
image compression |
0.2 | 1 | 2022 | Image-based Visualization of Large Volumetric Data Using Moments · IEEE Trans. Vis. Comput. Graph. 2022 |
Image and video coding
quantization |
0.2 | 1 | 2022 | Image-based Visualization of Large Volumetric Data Using Moments · IEEE Trans. Vis. Comput. Graph. 2022 |
Visualization and visual analytics
uncertainty visualization |
0.1 | 1 | 2021 | Visual Analysis of Large Multivariate Scattered Data using Clustering and Probabilistic Summaries · IEEE Trans. Vis. Comput. Graph. 2021 |
Visualization and visual analytics › data visualization › animated visualization › motion visualization
trajectory visualization |
0.1 | 1 | 2020 | Void-and-Cluster Sampling of Large Scattered Data and Trajectories · IEEE Trans. Vis. Comput. Graph. 2020 |
Methods — techniques the papers use, named apart from their topics
trigonometric moments · 0.6spatial and temporal interpolation · 0.6splatting · 0.5gaussian mixture model · 0.5error measure · 0.4blue noise sampling · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Image-based Visualization of Large Volumetric Data Using MomentsabstractWe present a novel image-based representation to interactively visualize large and arbitrarily structured volumetric data. This image-based representation is created from a fixed view and models the scalar densities along each viewing ray. Then, any transfer function can be applied and changed interactively to visualize the data. In detail, we transform the density in each pixel to the Fourier basis and store Fourier coefficients of a bounded signal, i.e. bounded trigonometric moments. To keep this image-based representation compact, we adaptively determine the number of moments in each pixel and present a novel coding and quantization strategy. Additionally, we perform spatial and temporal interpolation of our image representation and discuss the visualization of introduced uncertainties. Moreover, we use our representation to add single scattering illumination. Lastly, we achieve accurate results even with changes in the view configuration. We evaluate our approach on two large volume datasets and a time-dependent SPH dataset. Tobias Rapp, Christoph Peters 0002, Carsten Dachsbacher |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2021 | Stochastic Volume Rendering of Multi-Phase SPH DataabstractAbstract In this paper, we present a novel method for the direct volume rendering of large smoothed‐particle hydrodynamics (SPH) simulation data without transforming the unstructured data to an intermediate representation. By directly visualizing the unstructured particle data, we avoid long preprocessing times and large storage requirements. This enables the visualization of large, time‐dependent, and multivariate data both as a post‐process and in situ. To address the computational complexity, we introduce stochastic volume rendering that considers only a subset of particles at each step during ray marching. The sample probabilities for selecting this subset at each step are thereby determined both in a view‐dependent manner and based on the spatial complexity of the data. Our stochastic volume rendering enables us to scale continuously from a fast, interactive preview to a more accurate volume rendering at higher cost. Lastly, we discuss the visualization of free‐surface and multi‐phase flows by including a multi‐material model with volumetric and surface shading into the stochastic volume rendering. Max Piochowiak, Tobias Rapp, Carsten Dachsbacher |
Comput. Graph. Forum | 2 |
| 2021 | Visual Analysis of Large Multivariate Scattered Data using Clustering and Probabilistic SummariesabstractRapidly growing data sizes of scientific simulations pose significant challenges for interactive visualization and analysis techniques. In this work, we propose a compact probabilistic representation to interactively visualize large scattered datasets. In contrast to previous approaches that represent blocks of volumetric data using probability distributions, we model clusters of arbitrarily structured multivariate data. In detail, we discuss how to efficiently represent and store a high-dimensional distribution for each cluster. We observe that it suffices to consider low-dimensional marginal distributions for two or three data dimensions at a time to employ common visual analysis techniques. Based on this observation, we represent high-dimensional distributions by combinations of low-dimensional Gaussian mixture models. We discuss the application of common interactive visual analysis techniques to this representation. In particular, we investigate several frequency-based views, such as density plots in 1D and 2D, density-based parallel coordinates, and a time histogram. We visualize the uncertainty introduced by the representation, discuss a level-of-detail mechanism, and explicitly visualize outliers. Furthermore, we propose a spatial visualization by splatting anisotropic 3D Gaussians for which we derive a closed-form solution. Lastly, we describe the application of brushing and linking to this clustered representation. Our evaluation on several large, real-world datasets demonstrates the scaling of our approach. Tobias Rapp, Christoph Peters 0002, Carsten Dachsbacher |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2020 | Void-and-Cluster Sampling of Large Scattered Data and TrajectoriesabstractWe propose a data reduction technique for scattered data based on statistical sampling. Our void-and-cluster sampling technique finds a representative subset that is optimally distributed in the spatial domain with respect to the blue noise property. In addition, it can adapt to a given density function, which we use to sample regions of high complexity in the multivariate value domain more densely. Moreover, our sampling technique implicitly defines an ordering on the samples that enables progressive data loading and a continuous level-of-detail representation. We extend our technique to sample time-dependent trajectories, for example pathlines in a time interval, using an efficient and iterative approach. Furthermore, we introduce a local and continuous error measure to quantify how well a set of samples represents the original dataset. We apply this error measure during sampling to guide the number of samples that are taken. Finally, we use this error measure and other quantities to evaluate the quality, performance, and scalability of our algorithm. Tobias Rapp, Christoph Peters 0002, Carsten Dachsbacher |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2019 | Applying Visual Analytics to Physically Based RenderingabstractAbstract Physically based rendering is a well‐understood technique to produce realistic‐looking images. However, different algorithms exist for efficiency reasons, which work well in certain cases but fail or produce rendering artefacts in others. Few tools allow a user to gain insight into the algorithmic processes. In this work, we present such a tool, which combines techniques from information visualization and visual analytics with physically based rendering. It consists of an interactive parallel coordinates plot, with a built‐in sampling‐based data reduction technique to visualize the attributes associated with each light sample. Two‐dimensional (2D) and three‐dimensional (3D) heat maps depict any desired property of the rendering process. An interactively rendered 3D view of the scene displays animated light paths based on the user's selection to gain further insight into the rendering process. The provided interactivity enables the user to guide the rendering process for more efficiency. To show its usefulness, we present several applications based on our tool. This includes differential light transport visualization to optimize light setup in a scene, finding the causes of and resolving rendering artefacts, such as fireflies, as well as a path length contribution histogram to evaluate the efficiency of different Monte Carlo estimators. Gerard Simons, Sebastian Herholz, Victor Petitjean, Tobias Rapp, Marco Ament, Hendrik P. A. Lensch, Carsten Dachsbacher, Martin Eisemann, Elmar Eisemann |
Comput. Graph. Forum | 4 |