43 search results - page 4 / 9 » gd 2004 |
GD
2004
Springer
13 years 11 months ago
2004
Springer
The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no e...
GD
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
GD
2004
Springer
13 years 11 months ago
2004
Springer
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph view...
GD
2004
Springer
13 years 11 months ago
2004
Springer
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
GD
2003
Springer
13 years 11 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...