1 citations · 1 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali +1
A planar orthogonal drawing of a planar graph is a geometric representation of such that the vertices are drawn as distinct points of the plane, the edges are drawn as…
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…
ChordLink: A New Hybrid Visualization Model
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani +2
Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature m…
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…