Force-Directed Graph Visualization with Pre-Positioning: Improving Convergence Time and Quality of Layout

No Thumbnail Available
File version
Author(s)
Hua, J
Huang, ML
Huang, W
Wang, J
Nguyen, QV
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2012
Size
File type(s)
Location

Montpellier, France

License
Abstract

Modern visual analytics tools provide mechanism for users to gain unknown knowledge through effective visual interactions for user to quickly understand the progress of algorithms and adjust the input parameters on intermediate visualizations that towards the production of most satisfied outcome. This requires the quick production of a sequence of graph visualizations. However, the traditional force-directed graph drawing algorithms are very slow to reach an equilibrium configuration of forces. They usually spend tens of seconds producing the layout of a graph converge. Thus, they do not satisfy the requirement of rapid drawing of graphs. This paper proposes a fast convergence method for drawing force-directed graphs. We essentially precalculate the geometrical position of all vertices before applying a force-directed layout algorithm to reach the energy minimization of the graph layout. The experimental results have shown that this approach could not only reduce the convergence time but also the number of edge crossings that approves the quality of layout significantly.

Journal Title
Conference Title

Proceedings of the International Conference on Information Visualisation

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Human-computer interaction

Persistent link to this record
Citation