[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?
From: |
Juan Pablo Carbajal |
Subject: |
Re: [OF miscellaneous] Hilbert curve: recursion faster than loop? |
Date: |
Mon, 7 Aug 2017 08:18:03 +0200 |
> Yes, one algorithm takes the size of the matrix the other just the order
> for the recursive one you need to pass 2^n, for the non-recursive ones just n.
I am sorry, this wasn't clear from my post.
- [OF miscellaneous] Hilbert curve: recursion faster than loop?, JuanPi, 2017/08/05
- Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?, siko1056, 2017/08/06
- 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 <=
- 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