Universität Stuttgart

Permanent URI for this communityhttps://elib.uni-stuttgart.de/handle/11682/1

Browse

Author: search.filters.author.Weiskopf, DanielSubject: search.filters.subject.620

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Hagrid : using Hilbert and Gosper curves to gridify scatterplots
    (2022) Cutura, Rene; Morariu, Cristina; Cheng, Zhanglin; Wang, Yunhai; Weiskopf, Daniel; Sedlmair, Michael
    A common enhancement of scatterplots represents points as small multiples, glyphs, or thumbnail images. As this encoding often results in overlaps, a general strategy is to alter the position of the data points, for instance, to a grid-like structure. Previous approaches rely on solving expensive optimization problems or on dividing the space that alter the global structure of the scatterplot. To find a good balance between efficiency and neighborhood and layout preservation, we propose Hagrid , a technique that uses space-filling curves (SFCs) to “gridify” a scatterplot without employing expensive collision detection and handling mechanisms. Using SFCs ensures that the points are plotted close to their original position, retaining approximately the same global structure. The resulting scatterplot is mapped onto a rectangular or hexagonal grid, using Hilbert and Gosper curves. We discuss and evaluate the theoretic runtime of our approach and quantitatively compare our approach to three state-of-the-art gridifying approaches, DGrid , Small multiples with gaps SMWG , and CorrelatedMultiples CMDS , in an evaluation comprising 339 scatterplots. Here, we compute several quality measures for neighborhood preservation together with an analysis of the actual runtimes. The main results show that, compared to the best other technique, Hagrid is faster by a factor of four, while achieving similar or even better quality of the gridified layout. Due to its computational efficiency, our approach also allows novel applications of gridifying approaches in interactive settings, such as removing local overlap upon hovering over a scatterplot.
  • Thumbnail Image
    ItemOpen Access
    STEP : sequence of time-aligned edge plots
    (2024) Abdelaal, Moataz; Kannenberg, Fabian; Lhuillier, Antoine; Hlawatsch, Marcel; Menges, Achim; Weiskopf, Daniel
    We present sequence of time-aligned edge plots (STEP) : a sequence- and edge-scalable visualization of dynamic networks and, more broadly, graph ensembles. We construct the graph sequence by ordering the individual graphs based on specific criteria, such as time for dynamic networks. To achieve scalability with respect to long sequences, we partition the sequence into equal-sized subsequences. Each subsequence is represented by a horizontal axis placed between two vertical axes. The horizontal axis depicts the order within the subsequence, while the two vertical axes depict the source and destination vertices. Edges within each subsequence are depicted as segmented lines extending from the source vertices on the left to the destination vertices on the right throughout the entire subsequence, and only the segments corresponding to the sequence members where the edges occur are drawn. By partitioning the sequence, STEP provides an overview of the graphs’ structural changes and avoids aspect ratio distortion. We showcase the utility of STEP for two realistic datasets. Additionally, we evaluate our approach by qualitatively comparing it against three state-of-the-art techniques using synthetic graphs with varying complexities. Furthermore, we evaluate the generalizability of STEP by applying it to a graph ensemble dataset from the architecture domain.
  • Thumbnail Image
    ItemOpen Access
    Accelerated 2D visualization using adaptive resolution scaling and temporal reconstruction
    (2023) Becher, Michael; Heinemann, Moritz; Marmann, Thomas; Reina, Guido; Weiskopf, Daniel; Ertl, Thomas
    Data visualization relies on efficient rendering to allow users to interactively explore and understand their data. However, achieving interactive frame rates is often challenging, especially for high-resolution displays or large datasets. In computer graphics, several methods temporally reconstruct full-resolution images from multiple consecutive lower-resolution frames. Besides providing temporal image stability, they amortize the rendering costs over multiple frames and thus improve the minimum frame rate. We present a method that adopts this idea to accelerate 2D information visualization, without requiring any changes to the rendering itself. By exploiting properties of orthographic projection, our method significantly improves rendering performance while minimizing the loss of image quality during camera manipulation. For static scenes, it quickly converges to the full-resolution image. We discuss the characteristics and different modes of our method concerning rendering performance and image quality and the corresponding trade-offs. To improve ease of use, we provide automatic resolution scaling in our method to adapt to user-defined target frame rate. Finally, we present extensive rendering benchmarks to examine real-world performance for examples of parallel coordinates and scatterplot matrix visualizations, and discuss appropriate application scenarios and contraindications for usage.