Embedding problems for paths with direction constrained edges.

DOI10.1016/S0304-3975(01)00408-XzbMath1061.68120WikidataQ62042623 ScholiaQ62042623MaRDI QIDQ1853570

Giuseppe Di Battista, Anna Lubiw, Giuseppe Liotta, S. H. Whitesides

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Shape; Embedding; Path; Rectilinear layout

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)

Related Items

The shape of orthogonal cycles in three dimensions, Complexity results for three-dimensional orthogonal graph drawing, HV-planarity: algorithms and complexity, A note on 3D orthogonal drawings with direction constrained edges

Cites Work

• Unnamed Item
• Unnamed Item
• Three-dimensional graph drawing
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• New results on drawing angle graphs
• Three-dimensional orthogonal graph drawing algorithms
• Rectilinear Graphs and Their Embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Bounds For Orthogonal 3-D Graph Drawing
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• A Split&Push Approach to 3D Orthogonal Drawing
• Angles of Planar Triangular Graphs