14 citations · 19 across the 5 of their papers we have counts for
5 papers
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
Michael J. Bannister, William E. Devanny, David Eppstein +1
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. How…
Lombardi Drawings of Graphs
Christian A. Duncan, David Eppstein, Michael T. Goodrich +2
We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as…
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
Erin W. Chambers, David Eppstein, Michael T. Goodrich +1
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for th…
Planar Drawings of Higher-Genus Graphs
Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of…
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
Matthew Dickerson, David Eppstein, Michael T. Goodrich +1
In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for v…