Optimal Orthogonal Graph Drawing with Convex Bend Costs

DOI10.1007/978-3-642-39206-1_16MaRDI QIDQ5326560zbMATH OpenOpenAlexFDO

Authors Thomas Bläsius, Ignaz Rutter, Dorothea Wagner

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_16

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal orthogonal graph drawing with convex bend costs
• Bend-optimal orthogonal graph drawing in the general position model
• Bend-optimal orthogonal drawings of triconnected plane graphs
• scientific article; zbMATH DE number 2080108
• Bend-minimum orthogonal drawings in quadratic time
• The complexity of bendless three-dimensional orthogonal graph drawing
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• Algorithms and Computation
• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• Orthogonal drawing of high degree graphs with small area and few bends

Cited in

(7)

• Planar embeddings with small and uniform faces
• Orthogonal graph drawing with inflexible edges
• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with flexibility constraints
• Optimal orthogonal graph drawing with convex bend costs
• An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
• Orthogonal graph drawing with inflexible edges

This page was built for publication: Optimal Orthogonal Graph Drawing with Convex Bend Costs

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