A force-directed algorithm that preserves edge-crossing properties

DOI10.1016/S0020-0190(00)00042-9zbMath1014.68201OpenAlexW1975370820MaRDI QIDQ1607039

François Bertault

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00042-9

zbMATH Keywords

undirected graphdynamic graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Implementation of Sprouts: a graph drawing game ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ How to Draw a Planarization

Cites Work

• How to draw a planar graph on a grid
• Triangulating planar graphs while minimizing the maximum degree
• An algorithm for drawing general undirected graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A force-directed algorithm that preserves edge-crossing properties