9 papers · 1 filter
Stack and Queue Layouts with Defects
Michael A. Bekos, Carla Binucci, Emilio Di Giacomo +5
Linear layouts of graphs -- particularly \emph{stack} and \emph{queue} layouts -- are well-established types of representations in graph drawing, thanks to their connection with nu…
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…
Flipping Matchings is Hard
Carla Binucci, Fabrizio Montecchiani, Daniel Perz +1
Given a point set and a plane perfect matching on , a flip is an operation that replaces two edges of such that another plane…
Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
Patrizio Angelini, Carla Binucci, Giuseppe Di Battista +5
Unit edge-length drawings, rectilinear drawings (where each edge is either a horizontal or a vertical segment), and rectangular face drawings are among the most studied subjects in…
Min--planar Drawings of Graphs
Carla Binucci, Aaron Büngener, Giuseppe Di Battista +7
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. On…
Quasi-upward Planar Drawings with Minimum Curve Complexity
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta +1
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of ben…