4 papers
Universal Slope Sets for 1-Bend Planar Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta +1
We describe a set of slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree ; this establishes a new upper bound of on the 1-b…
A Distributed Force-Directed Algorithm on Giraph: Design and Experiments
Alessio Arleo, Walter Didimo, Giuseppe Liotta +1
In this paper we study the problem of designing a distributed graph visualization algorithm for large graphs. The algorithm must be simple to implement and the computing infrastruc…
On Guarding Orthogonal Polygons with Sliding Cameras
Therese Biedl, Timothy M. Chan, Stephanie Lee +3
A sliding camera inside an orthogonal polygon is a point guard that travels back and forth along an orthogonal line segment in . The sliding camera can see a point $…
Progress on Partial Edge Drawings
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger +4
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part o…