10 papers · 1 filter
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta +3
The \emph{local edge-length ratio} of a planar straight-line drawing is the largest ratio between the lengths of any pair of edges of that share a common vertex. The \emph{…
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time
Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point o…
On Turn-Regular Orthogonal Representations
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista +5
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other…
An Experimental Study of a 1-planarity Testing and Embedding Algorithm
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
The definition of -planar graphs naturally extends graph planarity, namely a graph is -planar if it can be drawn in the plane with at most one crossing per edge. Unfortunatel…
Simple -Planar Graphs are Simple -Quasiplanar
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…
Upward Book Embeddings of st-Graphs
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo +3
We study -page upward book embeddings (UBEs) of -graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on pages with the additional re…