arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.09367cs.GRcs.HC
收藏

MetroSets:将集合可视化为地铁地图

MetroSets: Visualizing Sets as Metro Maps

Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg

摘要:

我们提出MetroSets,一个新的,灵活的在线工具,可视化集系统使用地铁地图隐喻。我们建模一个给定的集系统作为一个超图$\mathcal{H} = (V, \mathcal{S})$,由一个集$V$的顶点和一个集$\mathcal{S}$,其中包含子集的$V$称为hyperedges。然后,我们的系统计算$\mathcal{H}$的地铁地图表示,其中$\mathcal{S}$中的每个超边$E$对应于地铁线路,每个顶点对应于地铁站。出现在两个或多个超边中的顶点被绘制为地铁地图中的交汇处,连接不同的集合。MetroSets基于一个模块化的4步流水线,该流水线构建并优化了基于路径的超图支持,然后使用地铁地图布局算法绘制并示意化。我们为MetroSet管道的每一步提出并实现了多种算法,并提供了一个具有易于使用的预设配置的功能原型。此外,使用几个真实世界的数据集,我们进行了广泛的定量评估的影响,不同的管道阶段所需的属性生成的地图,如八线性,单调性和边缘均匀性。

英文摘要:

We propose MetroSets, a new, flexible online tool for visualizing set systems using the metro map metaphor. We model a given set system as a hypergraph $\mathcal{H} = (V, \mathcal{S})$, consisting of a set $V$ of vertices and a set $\mathcal{S}$, which contains subsets of $V$ called hyperedges. Our system then computes a metro map representation of $\mathcal{H}$, where each hyperedge $E$ in $\mathcal{S}$ corresponds to a metro line and each vertex corresponds to a metro station. Vertices that appear in two or more hyperedges are drawn as interchanges in the metro map, connecting the different sets. MetroSets is based on a modular 4-step pipeline which constructs and optimizes a path-based hypergraph support, which is then drawn and schematized using metro map layout algorithms. We propose and implement multiple algorithms for each step of the MetroSet pipeline and provide a functional prototype with easy-to-use preset configurations. Furthermore, using several real-world datasets, we perform an extensive quantitative evaluation of the impact of different pipeline stages on desirable properties of the generated maps, such as octolinearity, monotonicity, and edge uniformity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑