activity
20082026
most citedMetroSets: Visualizing Sets as Metro Maps

36 citations · 216 across the 70 of their papers we have counts for

collaborators
Showing 2022Show all

9 papers · 1 filter

cs.CG2022

Minimum Link Fencing

Sujoy Bhore, Fabian Klute, Maarten Löffler +3

We study a variant of the geometric multicut problem, where we are given a set of colored and pairwise interior-disjoint polygons in the plane. The objective is to co…

cs.CC2022

On the Complexity of the Storyplan Problem

Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4

Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…

cs.GR2022

Shape-Guided Mixed Metro Map Layout

Tobias Batik, Soeren Terziadis, Yu-Shuen Wang +2

Metro or transit maps, are schematic representations of transit networks to facilitate effective route-finding. These maps are often advertised on a web page or pamphlet highlighti…

cs.GR2022

MosaicSets: Embedding Set Systems into Grid Graphs

Peter Rottmann, Markus Wallinger, Annika Bonerath +3

Visualizing sets of elements and their relations is an important research area in information visualization. In this paper, we present MosaicSets: a novel approach to create Euler-…

physics.soc-ph2022★ 2 cited

A Survey on Computing Schematic Network Maps: The Challenge to Interactivity

Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi +1

Schematic maps are in daily use to show the connectivity of subway systems and to facilitate travellers to plan their journeys effectively. This study surveys up-to-date algorithmi…

cs.CG2022

On Computing Optimal Linear Diagrams

Alexander Dobler, Martin Nöllenburg

Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical over…

cs.CG2022★ 3 cited

Planarizing Graphs and their Drawings by Vertex Splitting

Martin Nöllenburg, Manuel Sorge, Soeren Terziadis +3

The splitting number of a graph is the minimum number of vertex splits required to turn into a planar graph, where a vertex split removes a vertex , introduc…

cs.CG2022

Transitions in Dynamic Point Labeling

Thomas Depian, Guangping Li, Martin Nöllenburg +1

The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a d…

cs.MA2022

Multidimensional Manhattan Preferences

Jiehua Chen, Martin Nöllenburg, Sofia Simola +2

A preference profile (i.e., a collection of linear preference orders of the voters over a set of alternatives) with alternatives and voters is -Manhattan (resp. -Eucl…