Topology Preserving Constrained Graph Layout

DOI10.1007/978-3-642-00219-9_22zbMath1213.68441OpenAlexW2205695184MaRDI QIDQ3611855

Kim Marriott, Michael Wybrow, Tim Dwyer

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

Related Items (3)

How to Draw a Planarization ⋮ How to Draw a Planarization ⋮ Dunnart: A Constraint-Based Network Diagram Authoring Tool

Cites Work

• Constrained graph layout
• An algorithm for drawing general undirected graphs
• Integrating Edge Routing into Force-Directed Layout
• Dunnart: A Constraint-Based Network Diagram Authoring Tool
• Graph Drawing
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item

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