Orthogonal connector routing

DOI10.1007/978-3-642-11805-0_22MaRDI QIDQ3557880zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael Wybrow, Kim Marriott, Peter J. Stuckey

Publication date 27 April 2010

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11805-0_22

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Graph Drawing
• scientific article; zbMATH DE number 1693471
• A better heuristic for orthogonal graph drawings
• Computing orthogonal drawings with the minimum number of bends
• Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports

Cited in

(4)

• Graph Drawing
• A simple pipeline for orthogonal graph drawing
• A topology-shape-metrics framework for ortho-radial graph drawing
• Efficient Algorithms for Ortho-Radial Graph Drawing.

This page was built for publication: Orthogonal connector routing

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