942 search results - page 16 / 189 » Constraints in Graph Drawing Algorithms |
110
click to vote
GD
2008
Springer
15 years 4 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
126
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
173
click to vote
GD
1998
Springer
15 years 7 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
109
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
127
click to vote
GD
2003
Springer
15 years 8 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...