Reload

Whirlpool
Variation 1 of Hilbert curve	Variation 2 of Hilbert curve	Variation 1 of Approximating Polygon of Hilbert curve	Variation 2 of Approximating Polygon of Hilbert curve
TSP by using Hilbert curve		TSP by using Approximating Polygon of Hilbert curve
Hilbert Curve		Appoximating polygon of Hilbert Curve
-

Automatic version	Traveling Salesman problem (end point coincides with start point)	end point differs from start point	start point is given and end point is arbitrary	start point and end point are given
	Traveling Salesman problem by incremental method			by using Hilbert Curve
				by using Approximating polygon of Hilbert Curve
Click version	Traveling Salesman problem (end point coincides with start point)	end point differs from start point	start point is given and end point is arbitrary	start point and end point are given
	TSP with a lot of time

Screensaver

Traveling salesman problem's heauristic algorithm by using Hilbert Curve approximating polygon(Open 15/Sep/2003 : The 0th Revision Monday, 15-Sep-2003 15:18:35 JST)
Many cases are bad example. But sometimes we can get good examples.
Good example

References
Gerhart Reinelt, Springer-Verlag, Traveling Salesman - Comunicational Solutions for TSP Applications - Lecture Notes in Computer Science 840
E.L.Lawler, J.K.Lenstra, A.H.G.Rinnooy Kan, D.B.Shmoys���AWILEY, The Traveling Salesman Problem
H. Sagan, Space-Filling Curves, Springer-Verlag.
hiltsp.java

---

If you have a message, don't hesitate to send it by using
E-mail:Mail Form
or
BBS

---

English Home of Takashi Ohyama
Japanese Home of Takashi Ohyama