Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

GD
2007
Springer

favoriteEmaildiscussreport

131views Computer Graphics» more GD 2007»

Drawing Graphs with GLEE

14 years 5 months ago

Drawing Graphs with GLEE

Download research.microsoft.com

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 efﬁcient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.

Lev Nachmanson, George G. Robertson, Bongshin Lee

Real-time Traffic

Adjacent Vertex Swaps | Computer Graphics | GD 2007 | Spline Routing Algorithm | Tool Named Glee |

claim paper

Related Content

» Convex drawings of hierarchical planar graphs and clustered planar graphs

» Threedimensional orthogonal graph drawing algorithms

» Drawing Clustered Bipartite Graphs in Multicircular Style

» Using graph parsing for automatic graph drawing

» Techniques for the Refinement of Orthogonal Graph Drawings

» Coherent TimeVarying Graph Drawing with MultifocusContext Interaction

» A Parallel Algorithm for Planar Orthogonal Grid Drawings

» Graph Drawing in Motion

» Constraints in Graph Drawing Algorithms

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	GD
Authors	Lev Nachmanson, George G. Robertson, Bongshin Lee

Comments (0)