4 papers · 1 filter
Monotone Arc Diagrams with few Biarcs
Steven Chaplick, Henry Förster, Michael Hoffmann +1
We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.
Drawing Graphs with Circular Arcs and Right-Angle Crossings
Steven Chaplick, Henry Förster, Myroslav Kryven +1
In a RAC drawing of a graph, vertices are represented by points in the plane, adjacent vertices are connected by line segments, and crossings must form right angles. Graphs that ad…
On Arrangements of Orthogonal Circles
Steven Chaplick, Henry Förster, Myroslav Kryven +1
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Usin…
On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute +1
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by…