Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
摘要
Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Improved Visual Saliency of Graph Clusters with Orderable Node-Link LayoutsNora Al-Naami, Nicolas Médoc, Matteo Magnani, Mohammad GhoniemIEEE VIS 2024 · 被引用 8 次
- Reducing Ambiguities in Line-Based Density Plots by Image-Space ColorizationYumeng Xue, Patrick Paetzold, Rebecca Kehlbeck, Bin Chen 等IEEE VIS 2023 · 被引用 5 次
- RouteFlow: Trajectory-Aware Animated TransitionsDuan Li, Xinyuan Guo, Xinhuan Shu, Lanxi Xiao 等CHI 2025 · 被引用 4 次
- The Many Tendrils of the Octopus MapEduardo Puerta, Shani Claire Spivak, Michael CorrellCHI 2025 · 被引用 1 次
相关 Paper
- How Do People Perceive Bundling? An ExperimentMarkus Wallinger, Osman Akbulut, Kabir Ahmed Rufai, Helen C. Purchase 等CHI 2025 · 被引用 1 次
- It's a Wrap: Toroidal Wrapping of Network Visualisations Supports Cluster Understanding TasksKun-Ting Chen, Tim Dwyer, Benjamin Bach, Kim MarriottCHI 2021 · 被引用 10 次
- Diversified Top-k Route Planning in Road NetworkZihan Luo, Lei Li, Mengxuan Zhang, Wen Hua 等VLDB 2022 · 被引用 38 次
- Evaluating and Extending Speedup Techniques for Optimal Crossing Minimization in Layered Graph DrawingsConnor Wilson, Eduardo Puerta, Tarik Crnovrsanin, Sara Di Bartolomeo 等IEEE VIS 2024 · 被引用 3 次
- Weighted Graph Clustering via Scale Contraction and Graph Structure LearningHaobing Liu, Yinuo Zhang, Tingting Wang, Ruobing Jiang 等WWW 2026 · 被引用 4 次
