A force-directed algorithm that preserves edge-crossing properties

DOI10.1016/S0020-0190(00)00042-9MaRDI QIDQ1607039zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Topology-driven force-directed algorithms
• An algorithm for drawing general undirected graphs
• A heuristic approach towards drawings of graphs with high crossing resolution
• How to draw a planarization
• scientific article; zbMATH DE number 2080097

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 1256645 (Why is no real title available?)
• An algorithm for drawing general undirected graphs
• How to draw a planar graph on a grid
• Triangulating planar graphs while minimizing the maximum degree

Cited in

(4)

• How to draw a planarization
• Implementation of Sprouts: a graph drawing game
• Topology-driven force-directed algorithms
• An improved force-directed graph layout algorithm based on aesthetic criteria

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

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