首页> 外文期刊>IEEE transactions on visualization and computer graphics >Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization
【24h】

Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization

机译:迈向明确的边缘捆绑:研究融合图纸以实现网络可视化

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.
机译:在本文中,我们研究了汇合图(CD),这是一种基于网络连接性将节点链接图中的边缘捆绑在一起的技术。边缘捆绑技术旨在通过将线合并为公共路径或束来减少节点链接图中的边缘混乱。不幸的是,传统的捆绑技术引入了歧义,因为边缘仅通过空间邻近性而不是网络连接性进行捆绑;如果边缘在束中没有清楚地分开,则从其源到目标的边缘跟随会导致错误的连接感。相反,CD会根据常见的来源或目标捆绑边缘。因此,沿着汇合束的平滑路径表示精确的连通性。尽管已经从理论上描述了CD,但是目前尚缺乏对实际网络(即,具有某些平面限制的网络之外的网络)的实际研究和应用。在这里,我们提供了从任意有向和无向网络构造CD的第一种算法,并提出了一种简单的布局方法,该方法嵌入在沙盒环境中,为交互式探索提供了技术。然后,我们研究CD中的图案和伪像,并将其与其他常见的边缘捆绑技术进行比较。最后,我们介绍了第一个用户研究,该研究比较了边缘压缩技术,包括CD,功率图,地铁样式和常见边缘捆绑。我们发现,在可视化或网络分析方面没有特殊专业知识的用户可以轻松读取小型CD。与现有的捆绑技术相比,CD更有可能使人们正确地感知连接性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号