AffiliationUniversity of Arizona
MetadataShow full item record
CitationB. Jacobsen, M. Wallinger, S. Kobourov and M. Nöllenburg, "MetroSets: Visualizing Sets as Metro Maps," in IEEE Transactions on Visualization and Computer Graphics, vol. 27, no. 2, pp. 1257-1267, Feb. 2021, doi: 10.1109/TVCG.2020.3030475.
RightsCopyright © 2021, IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractWe 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. © 1995-2012 IEEE.
VersionFinal accepted manuscript
SponsorsNational Science Foundation