13 Zentrale Universitätseinrichtungen

Permanent URI for this collectionhttps://elib.uni-stuttgart.de/handle/11682/14

Browse

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • 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
    Visual analysis of fitness landscapes in architectural design optimization
    (2024) Abdelaal, Moataz; Galuschka, Marcel; Zorn, Max; Kannenberg, Fabian; Menges, Achim; Wortmann, Thomas; Weiskopf, Daniel; Kurzhals, Kuno
    In architectural design optimization, fitness landscapes are used to visualize design space parameters in relation to one or more objective functions for which they are being optimized. In our design study with domain experts, we developed a visual analytics framework for exploring and analyzing fitness landscapes spanning data, projection, and visualization layers. Within the data layer, we employ two surrogate models and three sampling strategies to efficiently generate a wide array of landscapes. On the projection layer, we use star coordinates and UMAP as two alternative methods for obtaining a 2D embedding of the design space. Our interactive user interface can visualize fitness landscapes as a continuous density map or a discrete glyph-based map. We investigate the influence of surrogate models and sampling strategies on the resulting fitness landscapes in a parameter study. Additionally, we present findings from a user study ( N = 12), revealing how experts’ preferences regarding projection methods and visual representations may be influenced by their level of expertise, characteristics of the techniques, and the specific task at hand. Furthermore, we demonstrate the usability and usefulness of our framework by a case study from the architecture domain, involving one domain expert.
  • Thumbnail Image
    ItemOpen Access
    Visual analytics for nonlinear programming in robot motion planning
    (2022) Hägele, David; Abdelaal, Moataz; Oguz, Ozgur S.; Toussaint, Marc; Weiskopf, Daniel
    Nonlinear programming is a complex methodology where a problem is mathematically expressed in terms of optimality while imposing constraints on feasibility. Such problems are formulated by humans and solved by optimization algorithms. We support domain experts in their challenging tasks of understanding and troubleshooting optimization runs of intricate and high-dimensional nonlinear programs through a visual analytics system. The system was designed for our collaborators’ robot motion planning problems, but is domain agnostic in most parts of the visualizations. It allows for an exploration of the iterative solving process of a nonlinear program through several linked views of the computational process. We give insights into this design study, demonstrate our system for selected real-world cases, and discuss the extension of visualization and visual analytics methods for nonlinear programming.