5 papers
Tangling and Untangling Trees on Point-sets
Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani +2
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed num…
Planar Stories of Graph Drawings: Algorithms and Experiments
Carla Binucci, Sabine Cornelsen, Walter Didimo +5
We address the problem of computing a dynamic visualization of a geometric graph as a sequence of frames. Each frame shows only a portion of the graph but their union covers $G…
The Price of Upwardness
Patrizio Angelini, Therese Biedl, Markus Chimani +8
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyon…
Simple Realizability of Abstract Topological Graphs
Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani +3
An abstract topological graph (AT-graph) is a pair , where is a graph and is a set of pairs of edges of . A re…
Optimal Orthogonal Drawings in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali +1
A planar orthogonal drawing Î of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are draw…