MetroSets: Visualizing Sets as Metro Maps
Authors:
- 14 October 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (2) , 1257-1267
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.Keywords
All Related Versions
Funding Information
- NSF (CCF-1740858, CCF-1712119, DMS-1839274)
- Vienna Science and Technology Fund (ICT19-035)
This publication has 74 references indexed in Scilit:
- Kelp Diagrams: Point Set Membership VisualizationComputer Graphics Forum, 2012
- Automatically drawing Euler diagrams with circlesJournal of Visual Languages & Computing, 2012
- Fully Automatic Visualisation of Overlapping SetsComputer Graphics Forum, 2009
- Visualizing set concordance with permutation matrices and fan diagramsInteracting with Computers, 2007
- The clustering matroid and the optimal clustering treeMathematical Programming, 2003
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991
- An algorithm for drawing general undirected graphsInformation Processing Letters, 1989
- Hypergraph planarity and the complexity of drawing venn diagramsJournal of Graph Theory, 1987
- A New Statistical Approach to Geographic Variation AnalysisSystematic Zoology, 1969
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960