Sciweavers

Share
13 search results - page 1 / 3
» Three-Dimensional Orthogonal Graph Drawing with Optimal Volu...
Sort
View
GD
2000
Springer
9 years 26 days ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
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...
Therese C. Biedl, Torsten Thiele, David R. Wood
GD
1998
Springer
9 years 1 months ago
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
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...
David R. Wood
GD
2003
Springer
9 years 2 months ago
Three-Dimensional Grid Drawings with Sub-quadratic Volume
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 ...
Vida Dujmovic, David R. Wood
ORDER
2006
97views more  ORDER 2006»
8 years 9 months ago
Upward Three-Dimensional Grid Drawings of Graphs
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 ...
Vida Dujmovic, David R. Wood
books