26 citations · 54 across the 13 of their papers we have counts for
7 papers · 1 filter
CelticGraph: Drawing Graphs as Celtic Knots and Links
Peter Eades, Niklas Gröne, Karsten Klein +4
Celtic knots are an ancient art form often attributed to Celtic cultures, used to decorate monuments and manuscripts, and to symbolise eternity and interconnectedness. This paper d…
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,…
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…
Drawing Big Graphs using Spectral Sparsification
Peter Eades, Quan Nguyen, Seok-Hee Hong
Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the u…
Towards Faithful Graph Visualizations
Quan Hoang Nguyen, Peter Eades
Readability criteria have been addressed as a measurement of the quality of graph visualizations. In this paper, we argue that readability criteria are necessary but not sufficient…
Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +7
We introduce and study the problem: Given planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there…