Drawing Graphs with GLEE

  • Lev Nachmanson
  • George Robertson
  • Bongshin Lee
Conference paper

DOI: 10.1007/978-3-540-77537-9_38

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4875)
Cite this paper as:
Nachmanson L., Robertson G., Lee B. (2008) Drawing Graphs with GLEE. In: Hong SH., Nishizeki T., Quan W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Lev Nachmanson
    • 1
  • George Robertson
    • 1
  • Bongshin Lee
    • 1
  1. 1.Microsoft ResearchRedmondUSA

Personalised recommendations