20 search results - page 1 / 4 » An Algorithm for Three-Dimensional Orthogonal Graph Drawing |
GD
1998
Springer
13 years 8 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
2000
Springer
13 years 8 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
2001
Springer
13 years 9 months ago
2001
Springer
BMCBI
2007
13 years 4 months ago
2007
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
DAM
2000
13 years 4 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...