Btw. an implementation of Lunnon's algorithm is online at http://www.jjj.de/fxt/demo/comb/#hilbert-ndim I find that one, uhm, awesome. * Steve Witham <sw@tiac.net> [Nov 12. 2008 12:34]:
In late August Fred Lunnon asked some questions about Hilbert walks in more than 2D. One of the questions was just, how do you map between the index of a point along the walk, and the coordinates of that point, if possible in a log-time way?
Some suggested it was simple, but as far as I know, none of the simple ideas actually generates a Hilbert-style walk.
I wrote privately to Fred that it *must* be simple ("trivial" is what I said, actually).
It's exactly two months from the date I wrote that, and I have working (though not at all optimized) code and a draft of a description of how it works up at http://www.tiac.net/~sw/2008/10/Hilbert
I would appreciate critique.
--humbled Steve
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun