37 search results - page 3 / 8 » gd 2005 |
GD
2005
Springer
13 years 11 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
GD
2005
Springer
13 years 11 months ago
2005
Springer
In technical drawings and medical drawings/maps it is often common to explain certain features of the drawing by blocks of text that are arranged on its boundary. Bekos et. al. int...
GD
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
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
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...