3 papers
cs.CG2024
On 1-bend Upward Point-set Embeddings of -digraphs
Emilio Di Giacomo, Henry Förster, Daria Kokhovich +4
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set em…
cs.CG2023
Crossing Minimization in Time Interval Storylines
Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic +2
Storyline visualizations are a popular way of visualizing characters and their interactions over time: Characters are drawn as x-monotone curves and interactions are visualized thr…
cs.CG2023
Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired…