96 citations · 329 across the 48 of their papers we have counts for
8 papers · 1 filter
Polyline Drawings with Topological Constraints
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta +2
Let be a simple topological graph and let be a polyline drawing of . We say that \emph{partially preserves the topology} of if it has the same external boundary,…
Turning Cliques into Paths to Achieve Planarity
Patrizio Angelini, Peter Eades, Seok-Hee Hong +5
Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call -Clique2Path Planarity: Given a graph , whose vertices…
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
An ortho-polygon visibility representation of a -plane graph (OPVR of ) is an embedding preserving drawing that maps each vertex of to a distinct orthogonal polyg…
(k,p)-Planarity: A Relaxation of Hybrid Planarity
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta +2
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph is -planar if can be partitioned into clusters of size at m…
A Survey on Graph Drawing Beyond Planarity
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configur…
Bend-minimum Orthogonal Drawings in Quadratic Time
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
Let be a planar -graph (i.e., a planar graph with vertex degree at most three) with vertices. We present the first -time algorithm that computes a planar orthogo…
Universal Slope Sets for Upward Planar Drawings
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo +2
We prove that every set of slopes containing the horizontal slope is universal for -bend upward planar drawings of bitonic -graphs with maximum vertex degre…
Edge Partitions of Optimal -plane and -plane Graphs
Michael Bekos, Emilio Di Giacomo, Walter Didimo +3
A topological graph is a graph drawn in the plane. A topological graph is -plane, , if each edge is crossed at most times. We study the problem of partitioning the edge…