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.

Document Downloads