Force-directed algorithms are among the most flexible methods for calculating layouts of
simple undirected graphs. Also known as spring embedders, such algorithms calculate the …

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

Force-directed layout algorithms produce graph drawings by resolving a system of emulated
physical forces. We present techniques for using social gravity as an additional force in force …

A Lombardi drawing of a graph is one in which vertices are represented as points, edges are
represented as circular arcs between their endpoints, and every vertex has perfect angular …

A recent line of work in graph drawing studies Lombardi drawings, ie, drawings with circular-
arc edges and perfect angular resolution at vertices. Little is known about the effects of …

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 …

We show that several types of graph drawing in the hyperbolic plane require features of the
drawing to be separated from each other by sub-constant distances, distances so small that …

We study the problem of creating smooth orthogonal layouts for planar graphs. While in
traditional orthogonal layouts every edge is made of a sequence of axis-aligned line …

In a Lombardi drawing of a graph the vertices are drawn as points and the edges are drawn
as circular arcs connecting their respective endpoints. Additionally, all vertices have perfect …

In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges
incident on vertices have perfect angular resolution. However, not every graph has a …