[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?

**From**: |
siko1056 |

**Subject**: |
Re: [OF miscellaneous] Hilbert curve: recursion faster than loop? |

**Date**: |
Sun, 6 Aug 2017 13:38:21 -0700 (PDT) |

JuanPi wrote
>* [1]:*
>* https://sourceforge.net/p/octave/miscellaneous/ci/default/tree/inst/hilbert_curve.m*
>* [2]: https://bitbucket.org/KaKiLa/mymfiles/src/tip/hilbert_curve_nr.m*
Juan,
I tried both of your algorithms and have no deeper insight into the Hilbert
curves, but I think your algorithm computes "more" than you expected. For n
= 2^2 I get using [1] 16 (x,y) coordinates and using [2] 256 complex
coordinates. Plotting both images shows me that [2] created a much higher
order Hilbert curve.
HTH,
Kai
--
View this message in context:
http://octave.1599824.n4.nabble.com/OF-miscellaneous-Hilbert-curve-recursion-faster-than-loop-tp4684339p4684354.html
Sent from the Octave - General mailing list archive at Nabble.com.

**[OF miscellaneous] Hilbert curve: recursion faster than loop?**, *JuanPi*, `2017/08/05`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**,
*siko1056* **<=**
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *Juan Pablo Carbajal*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *Juan Pablo Carbajal*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *siko1056*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *Juan Pablo Carbajal*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *Julien Bect*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *siko1056*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *Juan Pablo Carbajal*, `2017/08/07`
**Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?**, *Juan Pablo Carbajal*, `2017/08/07`