Results 1 
2 of
2
A Fast MultiScale Method for Drawing Large Graphs
 JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
, 2002
"... We present a multiscale layout algorithm for the aesthetic drawing of undirected graphs with straightline edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawi ..."
Abstract

Cited by 80 (10 self)
 Add to MetaCart
We present a multiscale layout algorithm for the aesthetic drawing of undirected graphs with straightline edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawing of a graph with over 15,000 vertices. Also we achieve "nice" drawings of 1000 vertex graphs in about 1 second. The proposed algorithm embodies a new multiscale scheme for drawing graphs, which was motivated by the earlier multiscale algorithm of Hadany and Harel [HH99]. In principle, it could significantly improve the speed of essentially any forcedirected method (regardless of that method's ability of drawing weighted graphs or the continuity of its costfunction).
COAST: A Convex Optimization Approach to StressBased Embedding
"... Abstract. Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce highquality layouts. If one requires that the layout also respect a given set of nonuniform edge lengths, ..."
Abstract
 Add to MetaCart
Abstract. Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce highquality layouts. If one requires that the layout also respect a given set of nonuniform edge lengths, however, forcebased approaches become problematic while energybased layouts become intractable. In this paper, we propose a reformulation of the energy or stress function into a twopart objective function to which we can apply the machinery of convex programming. We provide experimental results to show that this method scales well and produces attractive layouts while dealing with the edge length constraints. 1