6 papers · 1 filter
Recognizing and Embedding Simple Optimal 2-Planar Graphs
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density ques…
The QuaSEFE Problem
Patrizio Angelini, Henry Förster, Michael Hoffmann +4
We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph ind…
Planar Graphs of Bounded Degree have Constant Queue Number
Michael A. Bekos, Henry Förster, Martin Gronemann +4
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same que…
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Evmorfia Argyriou, Sabine Cornelsen, Henry Förster +5
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of c…
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
Michael A. Bekos, Henry Förster, Christian Geckeler +4
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the…
On RAC Drawings of Graphs with one Bend per Edge
Patrizio Angelini, Michael A. Bekos, Henry Förster +1
A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing…