4 citations · 10 across the 7 of their papers we have counts for
7 papers
On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4
Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs
William J. Lenhart, Giuseppe Liotta
Let be a straight-line drawing of a graph and let and be two vertices of . The Gabriel disk of is the disk having and as antipodal points. A pair $\lan…
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…
Monotone Simultaneous Embeddings of Paths in R^d
David Bremner, Olivier Devillers, Marc Glisse +5
We study the following problem: Given paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is mono…
Placing Arrows in Directed Graph Drawings
Carla Binucci, Markus Chimani, Walter Didimo +2
We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced una…
1-bend Upward Planar Drawings of SP-digraphs
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
It is proved that every series-parallel digraph whose maximum vertex-degree is admits an upward planar drawing with at most one bend per edge such that each edge segment has on…