4 papers
-Layer -Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
Patrizio Angelini, Giordano Da Lozzo, Henry Förster +1
The -layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, howe…
Drawing Shortest Paths in Geodetic Graphs
Sabine Cornelsen, Maximilian Pfister, Henry Förster +4
Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph , i.e.,…
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on…
Drawing planar graphs with few segments on a polynomial grid
Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck +1
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawin…