Three-dimensional orthogonal graph drawing algorithms

13 years 4 months ago

Download www.cs.mcgill.ca

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. The best previous result generated a drawing bounded by an O( n)

Peter Eades, Antonios Symvonis, Sue Whitesides

Real-time Traffic

DAM 2000 | Grid Drawings | Orthogonal Grid Drawings | Three-dimensional Grid Drawings |

claim paper

» ThreeDimensional Orthogonal Graph Drawing with Optimal Volume

» Bounded Degree Book Embeddings and ThreeDimensional Orthogonal Graph Drawing

» ThreeDimensional Phylogeny Explorer Distinguishing paralogs lateral transfer and violation...

» Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends

» A Note on the Selfsimilarity of Some Orthogonal Drawings

» A Parallel Algorithm for Planar Orthogonal Grid Drawings

» Refinement of Orthogonal Graph Drawings

» Techniques for the Refinement of Orthogonal Graph Drawings

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DAM
Authors	Peter Eades, Antonios Symvonis, Sue Whitesides

Comments (0)

Sciweavers

Three-dimensional orthogonal graph drawing algorithms

DAM 2000 | Grid Drawings | Orthogonal Grid Drawings | Three-dimensional Grid Drawings |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers