We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
This report describes the the Second Annual Graph Drawing Contest, held in conjunction with the 1995 Graph Drawing Symposium in Passau, Germany. The purpose of the contest is to b...
Franz-Josef Brandenburg, Ulrik Brandes, Peter Eade...
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
Apeksha Godiyal, Jared Hoberock, Michael Garland, ...
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...