STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations
Sara Di Bartolomeo, Mirek Riedewald, Wolfgang Gatterbauer, Cody Dunne
Abstract
Node-link visualizations are a familiar and powerful tool for displaying the relationships in a network. The readability of these visualizations highly depends on the spatial layout used for the nodes. In this paper, we focus on computing layered layouts, in which nodes are aligned on a set of parallel axes to better expose hierarchical or sequential relationships. Heuristic-based layouts are widely used as they scale well to larger networks and usually create readable, albeit sub-optimal, visualizations. We instead use a layout optimization model that prioritizes optimality - as compared to scalability - because an optimal solution not only represents the best attainable result, but can also serve as a baseline to evaluate the effectiveness of layout heuristics. We take an important step towards powerful and flexible network visualization by proposing Stratisfimal Layout, a modular integer-linear-programming formulation that can consider several important readability criteria simultaneously - crossing reduction, edge bendiness, and nested and multi-layer groups. The layout can be adapted to diverse use cases through its modularity. Individual features can be enabled and customized depending on the application. We provide open-source and documented implementations of the layout, both for web-based and desktop visualizations. As a proof-of-concept, we apply it to the problem of visualizing complicated SQL queries, which have features that we believe cannot be addressed by existing layout optimization models. We also include a benchmark network generator and the results of an empirical evaluation to assess the performance trade-offs of our design choices. A full version of this paper with all appendices, data, and source code is available at osf.io/qdyt9 with live examples at https://visdunneright.github.io/stratisfimal/.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 7240c805-824b-4447-a36a-f85e7c9fe9a0Cited by top-tier papers5
- On The Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational LanguagesWolfgang Gatterbauer, Cody DunneSIGMOD 2024 · 6 citations
- QEVIS: Multi-Grained Visualization of Distributed Query ExecutionQiaomu Shen, Zhengxin You, Xiao Yan, Chaozu Zhang et al.IEEE VIS 2023 · 5 citations
- Evaluating and Extending Speedup Techniques for Optimal Crossing Minimization in Layered Graph DrawingsConnor Wilson, Eduardo Puerta, Tarik Crnovrsanin, Sara Di Bartolomeo et al.IEEE VIS 2024 · 3 citations
- Quality Metrics and Reordering Strategies for Revealing Patterns in BioFabric VisualizationsJohannes Fuchs, Alexander Frings, Maria-Viktoria Heinle, Daniel A. Keim et al.IEEE VIS 2024 · 3 citations
- QOVIS: Understanding and Diagnosing Query Optimizer via a Visualization-assisted Approach (Revision)Zhengxin You, Qiaomu Shen, Man Lung Yiu, Bo TangVLDB 2025 · 1 citation
Related papers
- F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on FairnessTommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg et al.IEEE VIS 2025
- Automatic Polygon Layout for Primal-Dual Visualization of HypergraphsBotong Qu, Eugene Zhang, Yue ZhangIEEE VIS 2021 · 12 citations
- Generative Layout Modeling using Constraint GraphsWamiq Para, Paul Guerrero, Tom Kelly, Leonidas J. Guibas et al.ICCV 2021 · 93 citations
- 2D, 2.5D, or 3D? An Exploratory Study on Multilayer Network Visualisations in Virtual RealityStefan P. Feyer, Bruno Pinaud, Stephen G. Kobourov, Nicolas Brich et al.IEEE VIS 2023 · 12 citations
- DoughNets: Visualising Networks Using Torus WrappingKun-Ting Chen, Tim Dwyer, Kim Marriott, Benjamin BachCHI 2020 · 15 citations
