Jacobsen, B., Wallinger, M., Kobourov, S. G., & Nöllenburg, M. (2021). MetroSets: Visualizing Sets as Metro Maps. IEEE Transactions on Visualization and Computer Graphics, 27(2), 1257–1267. https://doi.org/10.1109/tvcg.2020.3030475
E192-01 - Forschungsbereich Algorithms and Complexity
-
Journal:
IEEE Transactions on Visualization and Computer Graphics
-
ISSN:
1077-2626
-
Date (published):
2021
-
Number of Pages:
11
-
Peer reviewed:
Yes
-
Keywords:
Software; Computer Graphics and Computer-Aided Design; Computer Vision and Pattern Recognition; Signal Processing
-
Abstract:
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 H = (V, S), consisting of a set V of vertices and a set S, which contains subsets of V called
hyperedges. Our system then computes a metro map representation of H, where each hyperedge E in 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.
