A note on 3D orthogonal drawings with direction constrained edges

DOI10.1016/J.IPL.2004.01.015zbMATH Open1177.68153OpenAlexW1973127769WikidataQ62042611 ScholiaQ62042611MaRDI QIDQ2390232FDOQ2390232

Authors: Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani 

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.01.015

Recommendations

• scientific article; zbMATH DE number 1974115
• scientific article; zbMATH DE number 2080106
• The shape of orthogonal cycles in three dimensions
• Three-dimensional orthogonal graph drawing algorithms
• scientific article; zbMATH DE number 1500687

zbMATH Keywords

computational geometry3D orthogonal drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Embedding problems for paths with direction constrained edges.
• Rectilinear Graphs and Their Embeddings
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• The shape of orthogonal cycles in three dimensions
• HV-planarity: algorithms and complexity
• Complexity results for three-dimensional orthogonal graph drawing
• A note on 3D orthogonal graph drawing
• 1-bend 3-D orthogonal box-drawings: Two open problems solved
• Title not available (Why is that?)

This page was built for publication: A note on 3D orthogonal drawings with direction constrained edges

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