7 citations · 8 across the 9 of their papers we have counts for
7 papers · 1 filter
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…
Morphing Contact Representations of Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +2
We consider the problem of morphing between contact representations of a plane graph. In an -contact representation of a plane graph , vertices are realized by inter…
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…
Drawing Planar Graphs with Many Collinear Vertices
Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati +2
Consider the following problem: Given a planar graph , what is the maximum number such that has a planar straight-line drawing with collinear vertices? This problem…
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…
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…