84 citations · 92 across the 11 of their papers we have counts for
6 papers · 1 filter
Beyond-Planarity: Density Results for Bipartite Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with…
On Vertex- and Empty-Ply Proximity Drawings
Patrizio Angelini, Steven Chaplick, Felice De Luca +7
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equ…
An Interactive Tool to Explore and Improve the Ply Number of Drawings
Niklas Heinsohn, Michael Kaufmann
Given a straight-line drawing of a graph , for every vertex the ply disk is defined as a disk centered at where the radius of the disk is half the length…
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
Michael A. Bekos, Henry Förster, Michael Kaufmann
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting…
3D Visibility Representations of 1-planar Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parall…
On Optimal 2- and 3-Planar Graphs
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. While for , optimal -planar graphs, i.e., those with vertices an…