38 citations · 68 across the 29 of their papers we have counts for
14 papers · 1 filter
Extending Biconnected Straight-Line Planar Drawings
Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo +5
The Partial Drawing Extensibility problem, for short PDE, takes as input a triple , where is a planar graph, is a subgraph of , and is a st…
A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista +3
Several algorithms for the construction of orthogonal drawings of graphs, including those based on the Topology-Shape-Metrics (TSM) paradigm, tend to prioritize the minimization of…
Ranking and Unranking of the Planar Embeddings of a Planar Graph
Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno +1
Let be the set of all the planar embeddings of a (not necessarily connected) -vertex graph . We present a bijection from to the natural number…
Unit-length Rectangular Drawings of Graphs
Carlos Alegria, Giordano Da Lozzo, Giuseppe Di Battista +3
A rectangular drawing of a planar graph is a planar drawing of in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segmen…
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…
How to Morph a Tree on a Small Grid
Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo +4
In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move a…
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…
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs
Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
In this paper we study a family of algorithms, introduced by Chan [SODA 1999] and called LR-algorithms, for drawing ordered rooted binary trees. In particular, we are interested in…
Computing NodeTrix Representations of Clustered Graphs
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati +1
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boun…
How to morph planar graph drawings
Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz +10
Given an -vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous tra…
Optimal Morphs of Convex Drawings
Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati +3
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each…
Properties and Complexity of Fan-Planarity
Carla Binucci, Emilio Di Giacomo, Walter Didimo +3
In a \emph{fan-planar drawing} of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who pro…
Morphing Planar Graphs Drawings Efficiently
Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani +1
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all time…
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo +5
We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the…