Drawing Clustered Graphs Using a Force-directed Placement Algorithm
Date Issued
2015
Date
2015
Author(s)
Ko, Yu-Jung
Abstract
We propose a novel layout algorithm to draw clustered graphs. The algorithm views intra-cluster graphs as stress models and inter-cluster graphs as spring and electrical force models. The basic idea of placement is based on stress majorization and force-directed placement algorithms using simulating annealing. It integrates the force from the center to push and pull the intra- cluster vertices based on their outside connectivity, referred as outside constriants, to modify the original stress model. And it applies the idea of torque equilibrium, coupled with some heuristics, to realize our force-directed placement algorithm. We demonstrate some contrived and real-world data with our algorithm, and compare our results with that of full stress majorization with respect to the running time and the number of edge crossings.
Subjects
graph drawing
force-directed algorithms
stress majorization
rotation heuristics
clustered graphs
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-104-R02921078-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):cf86e1637960c3b0a48dcaabaf9b99c7