Techniques for the Refinement of Orthogonal Graph Drawings

DOI10.7155/JGAA.00026MaRDI QIDQ4511258zbMATH OpenOpenAlexFDO

Authors Janet M. Six, Konstantinos G. Kakoulis, Ioannis G. Tollis

Publication date 14 December 2000

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

Full work available at URL https://eudml.org/doc/48614, http://www.emis.de/journals/JGAA/accepted/00/Six%2B00.4.3.pdf

zbMATH Keywords

graph drawing algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 2080109
• scientific article; zbMATH DE number 1693471
• A better heuristic for orthogonal graph drawings
• Algorithms for area-efficient orthogonal drawing
• Efficient orthogonal drawings of high degree graphs

Cited in

(10)

• Smooth Orthogonal Drawings of Planar Graphs
• Graph compact orthogonal layout algorithm
• Orthogonal drawings based on the stratification of planar graphs
• scientific article; zbMATH DE number 1693471 (Why is no real title available?)
• scientific article; zbMATH DE number 2084273 (Why is no real title available?)
• Overloaded orthogonal drawings
• The DFS-heuristic for orthogonal graph drawing
• scientific article; zbMATH DE number 1974102 (Why is no real title available?)
• scientific article; zbMATH DE number 2080109 (Why is no real title available?)
• Orthogonal Hypergraph Drawing for Improved Visibility

This page was built for publication: Techniques for the Refinement of Orthogonal Graph Drawings

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