9 citations · 15 across the 3 of their papers we have counts for
7 papers
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
Steven Chaplick, Fabian Lipp, Alexander Wolff +1
We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, r…
Computing Storyline Visualizations with Few Block Crossings
Thomas C. van Dijk, Fabian Lipp, Peter Markfelder +1
Storyline visualizations show the structure of a story, by depicting the interactions of the characters over time. Each character is represented by an x-monotone curve from left to…
Block Crossings in Storyline Visualizations
Thomas C. van Dijk, Martin Fink, Norbert Fischer +5
Storyline visualizations help visualize encounters of the characters in a story over time. Each character is represented by an x-monotone curve that goes from left to right. A meet…
Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp +3
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and…
Obstructing Visibilities with One Obstacle
Steven Chaplick, Fabian Lipp, Ji-won Park +1
Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topolog…
Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +7
We introduce and study the problem: Given planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there…
The Complexity of Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp +3
It is well known that any graph admits a crossing-free straight-line drawing in and that any planar graph admits the same even in . For a graph and…