Efficient orthogonal drawings of high degree graphs

DOI10.1007/S004539910006MaRDI QIDQ1969947zbMATH OpenOpenAlexFDO

Authors Achilleas Papakostas, Ioannis G. Tollis

Publication date 12 December 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004539910006

zbMATH Keywords

visualizationgraph drawingorthogonal graph drawing

Mathematics Subject Classification ID

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

Recommendations

• Orthogonal drawing of high degree graphs with small area and few bends
• Algorithms for area-efficient orthogonal drawing
• scientific article; zbMATH DE number 1693471
• Algorithms and bounds for overloaded orthogonal drawings
• A better heuristic for orthogonal graph drawings

Cited in

(21)

• Drawing Graphs with Right Angle Crossings
• Right Angle Crossing Drawings of Graphs
• A Riemannian approach to graph embedding
• On the Hardness of Orthogonal-Order Preserving Graph Drawing
• Square-orthogonal drawing with few bends per edge
• scientific article; zbMATH DE number 1693471 (Why is no real title available?)
• Orthogonal drawing of high degree graphs with small area and few bends
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• New results on drawing angle graphs
• Algorithms and bounds for overloaded orthogonal drawings
• Drawing graphs with right angle crossings
• scientific article; zbMATH DE number 2080110 (Why is no real title available?)
• Overloaded orthogonal drawings
• Non-planar square-orthogonal drawing with few-bend edges
• The DFS-heuristic for orthogonal graph drawing
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• Algorithms for area-efficient orthogonal drawing
• The three-phase method: a unified approach to orthogonal graph drawing
• An experimental comparison of four graph drawing algorithms.
• Techniques for the Refinement of Orthogonal Graph Drawings
• Orthogonal Hypergraph Drawing for Improved Visibility

This page was built for publication: Efficient orthogonal drawings of high degree graphs

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