DOIAbstract
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout method of Sugiyama [4]. The main features of the algorithm are that the edges are orthogonal and that each edge has at most two bends
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout method of Sugiyama [4]. The main features of the algorithm are that the edges are orthogonal and that each edge has at most two bends
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width...
The automatic layout of software diagrams is a very attractive graph drawing application for use in ...
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical...
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout m...
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. T...
The last fifteen years have seen an impressive growth of the number of existing graph drawing algori...
This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a ...
In radial drawings of hierarchical graphs the vertices are placed on concentric circles rather than ...
In this paper, we present a fast layout algorithm for k-level graphs with given permutations of the ...
this paper: the spring model algorithm, simulated annealing method and the Sugiyama algorithm. Appli...
The area of graph drawing is concerned with positioning the elements of a graph on a canvas such tha...
In this paper, we study orthogonal graph drawings from a practical point of view. Most previously ex...
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced...
We present InteractiveGiotto, an interactive algorithm for orthogonal graph drawing based on the net...
We present INTERACTIVEGIOTTO, an interactive algorithm for orthogonal graph drawing based on the net...
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width...
The automatic layout of software diagrams is a very attractive graph drawing application for use in ...
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical...
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout m...
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. T...
The last fifteen years have seen an impressive growth of the number of existing graph drawing algori...
This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a ...
In radial drawings of hierarchical graphs the vertices are placed on concentric circles rather than ...
In this paper, we present a fast layout algorithm for k-level graphs with given permutations of the ...
this paper: the spring model algorithm, simulated annealing method and the Sugiyama algorithm. Appli...
The area of graph drawing is concerned with positioning the elements of a graph on a canvas such tha...
In this paper, we study orthogonal graph drawings from a practical point of view. Most previously ex...
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced...
We present InteractiveGiotto, an interactive algorithm for orthogonal graph drawing based on the net...
We present INTERACTIVEGIOTTO, an interactive algorithm for orthogonal graph drawing based on the net...
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width...
The automatic layout of software diagrams is a very attractive graph drawing application for use in ...
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical...
Add to ORKG