4 papers · 1 filter
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…
A Survey on Graph Drawing Beyond Planarity
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configur…
Bend-minimum Orthogonal Drawings in Quadratic Time
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
Let be a planar -graph (i.e., a planar graph with vertex degree at most three) with vertices. We present the first -time algorithm that computes a planar orthogo…
Universal Slope Sets for Upward Planar Drawings
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo +2
We prove that every set of slopes containing the horizontal slope is universal for -bend upward planar drawings of bitonic -graphs with maximum vertex degre…