6 papers · 1 filter
Pole Dancing: 3D Morphs for Tree Drawings
Elena Arseneva, Prosenjit Bose, Pilar Cano +5
We study the question whether a crossing-free 3D morph between two straight-line drawings of an -vertex tree can be constructed consisting of a small number of linear morphing s…
Turning Cliques into Paths to Achieve Planarity
Patrizio Angelini, Peter Eades, Seok-Hee Hong +5
Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call -Clique2Path Planarity: Given a graph , whose vertices…
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
An ortho-polygon visibility representation of a -plane graph (OPVR of ) is an embedding preserving drawing that maps each vertex of to a distinct orthogonal polyg…
Greedy Rectilinear Drawings
Patrizio Angelini, Michael A. Bekos, Walter Didimo +6
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vert…
(k,p)-Planarity: A Relaxation of Hybrid Planarity
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta +2
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph is -planar if can be partitioned into clusters of size at m…
A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report
Stefano Bistarelli, Alessandra Tappini, Carlo Taticchi
The assignment of weights to attacks in a classical Argumentation Framework allows to compute semantics by taking into account the different importance of each argument. We represe…