An improved force-directed graph layout algorithm based on aesthetic criteria
DOI10.1007/S00791-014-0228-5zbMATH Open1388.68224OpenAlexW1998135728MaRDI QIDQ1685035FDOQ1685035
Authors: Wenqiang Dong, Xingyu Fu, Guangluan Xu, Yu Huang 
Publication date: 13 December 2017
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00791-014-0228-5
Recommendations
- Topology-driven force-directed algorithms
- A force-directed algorithm that preserves edge-crossing properties
- A new algorithm for removing node overlapping in graph visualization
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
- A force-directed algorithm for drawing directed graphs symmetrically
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Cites Work
- On the usability of Lombardi graph drawings
- Topology-driven force-directed algorithms
- An algorithm for drawing general undirected graphs
- How to Draw a Graph
- Graph-Theoretic Concepts in Computer Science
- Graph Drawing
- Force-directed Lombardi-style graph drawing
- A Fast Multi-Scale Method for Drawing Large Graphs
- A multi-dimensional approach to force-directed layouts of large graphs
- A force-directed algorithm that preserves edge-crossing properties
- An Experimental Study on Distance-Based Graph Drawing
- Force-directed graph drawing using social gravity and scaling
- A multi-scale algorithm for drawing graphs nicely
Cited In (2)
This page was built for publication: An improved force-directed graph layout algorithm based on aesthetic criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685035)
