scientific article; zbMATH DE number 2080105

MaRDI QIDQ4472316zbMATH OpenFDO

Authors David R. Wood

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1984/19840259.htm

Mathematics Subject Classification ID

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

Recommendations

• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
• Bounds For Orthogonal 3-D Graph Drawing
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Lower bounds for planar orthogonal drawings of graphs
• 1-bend 3-D orthogonal box-drawings: Two open problems solved

Cited in

(10)

• Lower bounds for planar orthogonal drawings of graphs
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• 1-bend 3-D orthogonal box-drawings: Two open problems solved
• On the Total Number of Bends for Planar Octilinear Drawings
• New Lower Bounds For Orthogonal Drawings
• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
• scientific article; zbMATH DE number 1500675 (Why is no real title available?)
• Bounds For Orthogonal 3-D Graph Drawing
• Drawing Kn in Three Dimensions with One Bend per Edge
• Graph Drawing

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 Q4472316)