## Force-directed algorithms for schematic drawings and placement: A survey

Force-directed algorithms have been developed over the last 50 years and used in many application fields, including information visualisation, biological network visualisation, sensor networks, routing algorithms, scheduling, graph drawing, etc. Our survey provides a comprehensive summary of developments and a full roadmap for state-of-the-art force-directed algorithms in schematic drawings and placement.

## Snapshot Visualization of Complex Graphs with Force-directed Algorithms

Force-directed algorithms are widely used for visualizing graphs. However, these algorithms are computationally expensive in producing good quality layouts for complex graphs. The layout quality is largely influenced by execution time and methods’ input parameters especially for large complex graphs. The snapshots of visualization generated from these algorithms are useful in presenting the current view or a past state of an information on timeslices. Therefore, researchers often need to make a trade-off between the quality of visualization and the selection of appropriate force-directed algorithms.

## Architecture of Force-directed Algorithms

A graph layout problem, or visualization problem, refers to a set of nodes and a set of relationships (edges) built on top of this set of nodes, calculating the position of the nodes and drawing each edge as a line or curve.

One of the most important research directions in the visualization technology of graphs is the study of graph layout algorithms. The core content of the graph layout algorithm research is to study how to display the graph structure in a better way. E.g. force-directed algorithms.

The comprehensive workflow for basic force-directed algorithms are summarized below:

- Kamada-Kawai Algorithm
- Fruchterman Reingold Algorithm
- ForceAtlas2 Algorithm
- LinLog Algorithm
- Davidson and Harel Algorithm

## Dataset of CNCAH Network

CNCAH shapes generated by the CNCAHNetGenerator. You can download the dataset from here. (more…)

## A layered approach to link analysis and visualization of event data

A layered approach to analysis and visualization of associations from events can provide different levels of abstraction for aggregating and analyzing events from heterogeneous data sources by using lists and customizable functions.

Si, Yain-Whar,Se-Hang Cheong, Simon Fong, Robert P. Biuk-Aghai, and Tat-Man Cheong. "A layered approach to link analysis and visualization of event data." In Digital Information Management (ICDIM), 2012 Seventh International Conference on, pp. 181-185. IEEE, 2012. The author’s version of a work that was accepted for publication can be downloaded from http://eric.lostcity-studio.com/wp-content/uploads/2019/08/ICDIM2012-AuthorCopy.pdf.