Spring algorithms and symmetry

DOI10.1016/S0304-3975(99)00239-XzbMath0945.68190MaRDI QIDQ1575440

Peter Eades, Xuemin Lin

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

spring algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Linkless symmetric drawings of series parallel digraphs ⋮ Geometric automorphism groups of graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Testing planarity of geometric automorphisms in linear time ⋮ \(H^1\)-parametrizations of complex planar physical domains in isogeometric analysis ⋮ Drawing series parallel digraphs symmetrically

Cites Work

• Area requirement and symmetry display of planar upward drawings
• Fast detection and display of symmetry in outerplanar graphs
• Algorithms for drawing graphs: An annotated bibliography
• An algorithm for drawing general undirected graphs
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• Convex Representations of Graphs
• AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
• How to Draw a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item