Browsing by Author "Guthe, Stefan"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
Item Influence of Container Resolutions on the Layout Stability of Squarified and Slice-And-Dice Treemaps(The Eurographics Association, 2020) Knauthe, Volker; Ballweg, Kathrin; Wunderlich, Marcel; Landesberger, Tatiana von; Guthe, Stefan; Kerren, Andreas and Garth, Christoph and Marai, G. ElisabetaIn this paper, we analyze the layout stability for the squarify and slice-and-dice treemap layout algorithms when changing the visualization containers resolution. We also explore how rescaling a finished layout to another resolution compares to a recalculated layout, i.e. fixed layout versus changing layout. For our evaluation, we examine a real world use-case and use a total of 240000 random data treemap visualizations. Rescaling slice-and-dice or squarify layouts affects the aspect ratios. Recalculating slice-and-dice layouts is equivalent to rescaling since the layout is not affected by changing the container resolution. Recalculating squarify layouts, on the other hand, yields stable aspect ratios but results in potentially huge layout changes. Finally, we provide guidelines for using rescaling, recalculation and the choice of algorithm.Item Massively Parallel Large Scale Inundation Modelling(The Eurographics Association, 2022) Rak, Arne; Guthe, Stefan; Mewis, Peter; Bujack, Roxana; Tierny, Julien; Sadlo, FilipOver the last 20 years, flooding has been the most common natural disaster, accounting for 44.7% of all disasters, affecting about 1.65 billion people worldwide and causing roughly 105 thousand deaths†. In contrast to other natural disasters, the impact of floods is preventable through affordable structures such as dams, dykes and drainage systems. To be most effective, however, these structures have to be planned and evaluated using the highest precision data of the underlying terrain and current weather conditions. Modern laser scanning techniques provide very detailed and reliable terrain information that may be used for flood inundation modelling in planning and hazard warning systems. These warning systems become more important since flood hazards increase in recent years due to ongoing climate change. In contrast to simulations in planning, simulations in hazard warning systems are time critical due to potentially fast changing weather conditions and limited accuracy in forecasts. In this paper we present a highly optimized CUDA implementation of a numerical solver for the hydraulic equations. Our implementation maximizes the GPU's memory throughput, achieving up to 80% utilization. A speedup of a factor of three is observed in comparison to previous work. Furthermore, we present a low-overhead, in-situ visualization of the simulated data running entirely on the GPU. With this, an area of 15 km2 with a resolution of 1 m can be visualized hundreds of times faster than real time on consumer grade hardware. Furthermore, the flow settings can be changed interactively during computation.Item Profiling and Visualizing GPU Memory Access and Cache Behavior of Ray Tracers(The Eurographics Association, 2022) Buelow, Max von; Riemann, Kai; Guthe, Stefan; Fellner, Dieter W.; Bujack, Roxana; Tierny, Julien; Sadlo, FilipGraphical processing units (GPUs) have gained popularity in recent years due to their efficiency in running massively parallel applications. Recent developments have also adapted ray-tracing algorithms to the GPU, where the bottleneck in the overall performance is usually given by the memory bandwidth. In this paper, we present an interactive, web-based visualization tool for GPU memory traces that provides visual insight into the memory and cache behavior of our reference ray tracer, by mapping internal GPU state back onto 3D objects. In order to visualize cache behavior, we use reuse distances on both GPU cache layers that are calculated on the basis of memory traces extracted from a real GPU using binary instrumentation. An advantage of our system is that it runs independently of the ray-tracing program. We further show visualizations of our GPU ray tracer and compare the visualizations of several ray-tracing approaches. We find our work to act as a convenient toolset to gather insights on which data structures and mesh regions can be cached efficiently, and how ray-tracing acceleration structures behave on various input meshes, bounding volume hierarchies, memory layouts, frame buffer resolutions, and work distribution techniques.Item Reconstructing Bounding Volume Hierarchies from Memory Traces of Ray Tracers(The Eurographics Association, 2022) Buelow, Max von; Stensbeck, Tobias; Knauthe, Volker; Guthe, Stefan; Fellner, Dieter W.; Yang, Yin; Parakkat, Amal D.; Deng, Bailin; Noh, Seung-TakThe ongoing race to improve computer graphics leads to more complex GPU hardware and ray tracing techniques whose internal functionality is sometimes hidden to the user. Bounding volume hierarchies and their construction are an important performance aspect of such ray tracing implementations. We propose a novel approach that utilizes binary instrumentation to collect memory traces and then uses them to extract the bounding volume hierarchy (BVH) by analyzing access patters. Our reconstruction allows combining memory traces captured from multiple ray tracing views independently, increasing the reconstruction result. It reaches accuracies of 30% to 45% when comparing against the ground-truth BVH used for ray tracing a single view on a simple scene with one object. With multiple views it is even possible to reconstruct the whole BVH, while we already achieve 98% with just seven views. Because our approach is largely independent of the data structures used internally, these accurate reconstructions serve as a first step into estimation of unknown construction techniques of ray tracing implementations.Item Segmentation-Based Near-Lossless Compression of Multi-View Cultural Heritage Image Data(The Eurographics Association, 2020) Buelow, Max von; Tausch, Reimar; Knauthe, Volker; Wirth, Tristan; Guthe, Stefan; Santos, Pedro; Fellner, Dieter W.; Spagnuolo, Michela and Melero, Francisco JavierCultural heritage preservation using photometric approaches received increasing significance in the past years. Capturing of these datasets is usually done with high-end cameras at maximum image resolution enabling high quality reconstruction results while leading to immense storage consumptions. In order to maintain archives of these datasets, compression is mandatory for storing them at reasonable cost. In this paper, we make use of the mostly static background of the capturing environment that does not directly contribute information to 3d reconstruction algorithms and therefore may be approximated using lossy techniques. We use a superpixel and figure-ground segmentation based near-lossless image compression algorithm that transparently decides if regions are relevant for later photometric reconstructions. This makes sure that the actual artifact or structured background parts are compressed with lossless techniques. Our algorithm achieves compression rates compared to the PNG image compression standard ranging from 1:2 to 1:4 depending on the artifact size.