Orthogonal graph drawing with flexibility constraints

DOI10.1007/978-3-642-18469-7_9MaRDI QIDQ3073663zbMATH OpenOpenAlexFDO

Authors Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner

Publication date 11 February 2011

Published in Graph Drawing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with inflexible edges
• Orthogonal graph drawing with inflexible edges
• Optimal orthogonal graph drawing with convex bend costs
• Optimal Orthogonal Graph Drawing with Convex Bend Costs

Cited in

(14)

• Interactive orthogonal graph drawing
• Orthogonal layout with optimal face complexity
• Colorability in Orthogonal Graph Drawing
• An annotated review on graph drawing and its applications
• Orthogeodesic point-set embedding of trees
• Relating bends and size in orthogonal graph drawings
• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with inflexible edges
• Orthogonal graph drawing with inflexible edges
• Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
• The DFS-heuristic for orthogonal graph drawing
• Orthogonal layout with optimal face complexity
• Confluent Orthogonal Drawings of Syntax Diagrams
• Orthogonal Hypergraph Drawing for Improved Visibility

This page was built for publication: Orthogonal graph drawing with flexibility constraints

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