Smooth paths in a polygonal channel
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Short and Smooth Polygonal Paths
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Simple and Efficient Bilayer Cross Counting
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Journal of Experimental Algorithmics (JEA)
Graph layering by promotion of nodes
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
An efficient implementation of sugiyama's algorithm for layered graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visual analysis of importance and grouping in software dependency graphs
Proceedings of the 4th ACM symposium on Software visualization
Improving layered graph layouts with edge bundling
GD'10 Proceedings of the 18th international conference on Graph drawing
Edge routing with ordered bundles
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
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.