Algorithm in this applet

Assume that there are N points.

1. Locate M(smaller than N-1) points in the convex hull of N points.

2. Draw the minimum spanning tree.

3. If the length of the tree isn't minimum,then goto 1.

4. Compute the best location of Additional points by using itteration method. Goto 1.

References

Frank K. Hwang, Dana S. Richards,Pawel Winter, North-Holland, The Steiner tree problem

Hans Jürgen Prõmel, Angelika Steger, vieweg, The Steiner Tree Problem

msteiner.java

If you have a message, don't hesitate to send it by using

E-mail:Mail Form

or

BBS

Use of Takashi Ohyama's website

English Home of Takashi Ohyama

Japanese Home of Takashi Ohyama