Make your own free website on Tripod.com
next up previous contents
Next: Graph'O->Mat Manual (PC - Up: Spring Algorithm - JAVA Previous: Spring Algorithm - JAVA

DynaSpring Algorithm - JAVA

The dynamic spring algorithm is a better spring algorithm. Not only the momentary movement of the vertices is calculated, but also the last movement of the vertex gets into this calculation and therefore the whole movement of a vertex is dynamically connected to the other vertices. It also takes care of how big the difference between the actual edge-length and the best edge-length is and calculates the velocity of the movement dependent on this fact. This results in a dynamic movement of the whole graph as if the edges where springs.


next up previous contents
Next: Graph'O->Mat Manual (PC - Up: Spring Algorithm - JAVA Previous: Spring Algorithm - JAVA

(k)1998 Graph->O'Mat Team