leni536/fast_hilbert_curve
View on GitHub ↗ ★ 16 C
Fast caclulation of the coordinates of the nth point of the Hilbert curve
4 mentions on Hacker News by 1 person: 0 stories, 4 comments · first 2017-01-31 · latest 2018-04-27
20082026
-
Well, not written in assembly but uses x86 intrinsics: https://github.com/leni536/fast_hilbert_curve I'm pretty proud of it. It calculates the coordinates of the nth point on the hilbert curve. No loops, no branches. It uses the pext, pdep…
comment by leni536 · 2018-04-27 · in Ask HN: What are some examples of beautiful x86 assembly code? -
…covers a 512x256 rectangle). On today's CPUs it can be calculated quite fast (shameless selfplug: https://github.com/leni536/fast_hilbert_curve ). I suspect that the resulting pattern on the screen would be less random looking, but more…
comment by leni536 · 2017-08-29 · in FizzleFade -
…are simpler, but it's fast to calculate Hilbert curves on modern CPUs too. Just to self plug: https://github.com/leni536/fast_hilbert_curve I only implemented the index->XY calculation yet. It compiles to 36 instructions without any…
comment by leni536 · 2017-06-13 · in Z-order curve usage to decrease dimensionality to 1 -
…on a Hilbert curve. It uses pext and pdep intrinsics to avoid loops, it's completely branchless. https://github.com/leni536/fast_hilbert_curve https://github.com/leni536/fast_hilbert_curve/wiki/How-effic... Maybe I will write an…
comment by leni536 · 2017-01-31 · in Bit permutations