26 citations · 54 across the 13 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CG2018
Polyline Drawings with Topological Constraints
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta +2
Let be a simple topological graph and let be a polyline drawing of . We say that \emph{partially preserves the topology} of if it has the same external boundary,…
cs.CG2018
The Weighted Barycenter Drawing Recognition Problem
Peter Eades, Patrick Healy, Nikola S. Nikolov
We consider the question of whether a given graph drawing of a triconnected planar graph is a weighted barycenter drawing. We answer the question with an elegant arithmetic…
cs.DS2018
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…