Breadcrumb

 
 

Graph drawing with spring algorithm

Title:

Graph drawing with spring algorithm

Cheng, SiXin (2002) Graph drawing with spring algorithm. Other thesis, Concordia University.

[img]
Preview
PDF
1514Kb

Abstract

Graph drawing research investigates the automatic methods for visual representation of graph. The spring algorithm draws graph layout by simulating physical model. It is easy to understand and implement, and it generally produces a pleasing layout. A spring algorithm with new termination method is introduced in this report. The spring algorithm is applicable to undirected, connected simple graphs. It can be used to produce graph layout with uniform length of edge and evenly distributed vertices. The algorithm starts from random initial configuration. Then, it iteratively minimizes the force acting on a vertex until it reaches the upper bound of the force. Finally, the algorithm stops when the remaining force is under the lower bound of the force.

Divisions:Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Other)
Authors:Cheng, SiXin
Pagination:vi, 51 leaves ; 29 cm.
Institution:Concordia University
Degree Name:Major reports (M.Comp.Sc.)
Program:Computer Science and Software Engineering
Date:2002
Thesis Supervisor(s):Grogono, Peter
ID Code:1811
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 13:22
Last Modified:08 Dec 2010 10:22
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer