most citedThe Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings

14 citations · 14 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CG2014★ 14 cited

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…