no code implementations • 15 Dec 2020 • Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt
For a class $\mathcal{D}$ of drawings of loopless (multi-)graphs in the plane, a drawing $D \in \mathcal{D}$ is \emph{saturated} when the addition of any edge to $D$ results in $D' \notin \mathcal{D}$ - this is analogous to saturated graphs in a graph class as introduced by Tur\'an (1941) and Erd\H{o}s, Hajnal, and Moon (1964).
Computational Geometry Discrete Mathematics Combinatorics
1 code implementation • 26 Jun 2018 • Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink
Finally, we make two known algorithms embedding-preserving; for drawing 1-planar RAC graphs with at most one bend per edge and for drawing IC-planar RAC graphs straight-line.
Computational Geometry Discrete Mathematics
