Overloaded orthogonal drawings

DOI10.1007/978-3-642-25878-7_24MaRDI QIDQ3223958zbMATH OpenOpenAlexFDO

Authors Evgenios M. Kornaropoulos, Ioannis G. Tollis

Publication date 9 March 2012

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25878-7_24

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and bounds for overloaded orthogonal drawings
• Efficient orthogonal drawings of high degree graphs
• A better heuristic for orthogonal graph drawings
• Techniques for the Refinement of Orthogonal Graph Drawings
• scientific article; zbMATH DE number 1693471

Cites work

• A better heuristic for orthogonal graph drawings
• Algorithms for area-efficient orthogonal drawing
• Algorithms for computing a parameterized \(st\)-orientation
• Applications of parameterized st-orientations
• Area requirement and symmetry display of planar upward drawings
• Computing an st-numbering
• Computing and Combinatorics
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Confluent layered drawings
• Efficient orthogonal drawings of high degree graphs
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 1858605 (Why is no real title available?)
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On minimal-node-cost planar embeddings
• Orthogonal Drawings of Plane Graphs Without Bends
• The three-phase method: a unified approach to orthogonal graph drawing

Cited in

(6)

• Algorithms and bounds for overloaded orthogonal drawings
• Algorithms and bounds for L-drawings of directed graphs
• scientific article; zbMATH DE number 1194183 (Why is no real title available?)
• Planar L-drawings of directed graphs
• Planar L-drawings of directed graphs
• Drawing Order Diagrams Through Two-Dimension Extension

This page was built for publication: Overloaded orthogonal drawings

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