It allows you to :
This makes it suitable for flattening 2-d data to 1 dimension and possibly some neighbour finding and graphical stuff.
It also apparently lets you solve the travelling salesman problem in a non-optimal but in O(n) which is quite good. Doing so is left as an exersize for the reader.
useful release of Math::Curve::Hilbert 0 Comments More | Login | Reply /