Drawing Graphs with GLEE

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.

• Type: Conference
• Year: 2007
• Where: GD
• Authors: Lev Nachmanson, George G. Robertson, Bongshin Lee
• Keywords: Adjacent Vertex Swaps, Computer Graphics, GD 2007, Spline Routing Algorithm, Tool Named Glee