Topology Preserving Constrained Graph Layout

DOI10.1007/978-3-642-00219-9_22MaRDI QIDQ3611855zbMATH OpenOpenAlexFDO

Authors Tim Dwyer, Kim Marriott, Michael Wybrow

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Constrained graph layout
• Constrained graph layout by stress majorization and gradient projection
• Graph layout with versatile boundary constraints
• Layout with circular and other non-linear constraints using Procrustes projection
• More flexible radial layout

Cites work

• An algorithm for drawing general undirected graphs
• Constrained graph layout
• Dunnart: A Constraint-Based Network Diagram Authoring Tool
• Graph Drawing
• Graph Drawing
• scientific article; zbMATH DE number 1693471 (Why is no real title available?)
• scientific article; zbMATH DE number 2084280 (Why is no real title available?)
• Inserting an edge into a planar graph
• Integrating Edge Routing into Force-Directed Layout

Cited in

(8)

• Constrained graph layout by stress majorization and gradient projection
• Constrained graph layout
• Graph layout with versatile boundary constraints
• Incremental grid-like layout using soft and hard constraints
• How to draw a planarization
• Layout with circular and other non-linear constraints using Procrustes projection
• Dunnart: A Constraint-Based Network Diagram Authoring Tool
• How to draw a planarization

This page was built for publication: Topology Preserving Constrained Graph Layout

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