scientific article; zbMATH DE number 1500687

zbMATH Open0953.05074MaRDI QIDQ4501708FDOQ4501708

David R. Wood

Publication date: 6 November 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

orthogonal gridorthogonal drawinglayout-based algorithmrouting-based algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (9)

• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• Embedding problems for paths with direction constrained edges.
• 1-bend 3-D orthogonal box-drawings: Two open problems solved
• The DFS-heuristic for orthogonal graph drawing
• Three-dimensional orthogonal graph drawing algorithms
• A Split&Push Approach to 3D Orthogonal Drawing
• A multi-dimensional approach to force-directed layouts of large graphs
• Balanced vertex-orderings of graphs
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501708)