New Lower Bounds For Orthogonal Drawings

DOI10.7155/JGAA.00010MaRDI QIDQ4243440zbMATH OpenOpenAlexFDO

Authors Therese Biedl

Publication date 18 May 1999

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/48188

zbMATH Keywords

embeddinglower boundsorthogonal graph drawings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Lower bounds for planar orthogonal drawings of graphs
• Relating bends and size in orthogonal graph drawings
• Bounds For Orthogonal 3-D Graph Drawing
• scientific article; zbMATH DE number 2080105

Cited in

(7)

• On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
• New results on drawing angle graphs
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Drawing \(K_{2,n}\): A lower bound
• Algorithms for area-efficient orthogonal drawing
• Schnyder decompositions for regular plane graphs and application to drawing
• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

This page was built for publication: New Lower Bounds For Orthogonal Drawings

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