Lecture Notes in Computer Science Volume 4875, 2008, pp 389-394

Drawing Graphs with GLEE

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.

The full version of the paper is available at ftp://ftp.research.microsoft.com/pub/tr/TR-2007-72.pdf. GLEE can be downloaded at http://research.microsoft.com/~levnach/GLEEWebPage. htm.