12 search results - page 1 / 3 » Three-Dimensional Orthogonal Graph Drawing with Optimal Volu... |
GD
2000
Springer
13 years 11 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
GD
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
GD
2003
Springer
14 years 16 days ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
GD
2001
Springer
13 years 11 months ago
2001
Springer
ORDER
2006
13 years 7 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...