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
We have implemented a graph layout algorithm of C. Walshaw as a plug-in in the Cytoscape bioinformat...
AbstractThis work contributes to the wide research area of visualization of hierarchical graphs. We ...
Many diagrams encountered in numerous areas can be modeled as graphs. Examples include UML diagrams,...
This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a ...
Abstract. These technical notes are comments on my work on GLEE, Graph Layout Execution Engine. GLEE...
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout m...
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
In this paper, we present a fast layout algorithm for k-level graphs with given permutations of the ...
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced...
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. T...
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width...
Hand-drawing a node-and-edge graph is a simple visual problem solving technique; however as the grap...
One challenge in node-link diagrams is how to efficiently provide a node placement or layout that wi...
The area of graph drawing is concerned with positioning the elements of a graph on a canvas such tha...
We have implemented a graph layout algorithm of C. Walshaw as a plug-in in the Cytoscape bioinformat...
AbstractThis work contributes to the wide research area of visualization of hierarchical graphs. We ...
Many diagrams encountered in numerous areas can be modeled as graphs. Examples include UML diagrams,...
This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a ...
Abstract. These technical notes are comments on my work on GLEE, Graph Layout Execution Engine. GLEE...
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout m...
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced...
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic...
In this paper, we present a fast layout algorithm for k-level graphs with given permutations of the ...
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced...
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. T...
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width...
Hand-drawing a node-and-edge graph is a simple visual problem solving technique; however as the grap...
One challenge in node-link diagrams is how to efficiently provide a node placement or layout that wi...
The area of graph drawing is concerned with positioning the elements of a graph on a canvas such tha...
We have implemented a graph layout algorithm of C. Walshaw as a plug-in in the Cytoscape bioinformat...
AbstractThis work contributes to the wide research area of visualization of hierarchical graphs. We ...
Many diagrams encountered in numerous areas can be modeled as graphs. Examples include UML diagrams,...
DOI
Add to ORKG