In a metro-map embedding, two paths cross in a so-called vertex crossing if they pass through the vertex and alternate in the circular ordering around it. We ...

Apr 11, 2021 · Crossing Vertex Minimization. Given a pair (G, Π) or a pair (G, Π), we seek for a metro-map embedding that minimizes the number of crossing ...

This definition of a metro-map embedding is motivated by visual representations of hypergraphs using the metro-map metaphor. In a metro-map embedding, two paths ...

Using the Metro-Map Metaphor for Drawing Hypergraphs ... Authors: Fabian Frank; Michael Kaufmann; Stephen Kobourov; Tamara Mchedlidze; Sergey Pupyrev; Torsten ...

Fingerprint. Dive into the research topics of 'Using the Metro-Map Metaphor for Drawing Hypergraphs'. Together they form a unique fingerprint.

Using the Metro-Map Metaphor for Drawing Hypergraphs. Frank F, Kaufmann M, Kobourov S, Mchedlidze T, Pupyrev S, Ueckerdt T, and Wolff A.

... metro- map drawing of a vertex-complete hypergraph with four hyperedges. The drawing is constructed recursively by routing the new (blue) hyperedge through ...

Jan 1, 2021 · Frank, F., Kaufmann, M., Kobourov, S., Mchedlidze, T., Pupyrev, S., Ueckerdt, T., & Wolff, A. Using the MetroMap Metaphor for Drawing ...

Jul 25, 2019 · A metro map drawing of a hypergraph is a visualization of a hypergraph in which each hyperedge of the hypergraph is drawn as a metro line ...