search

becheran / fast-hilbert

Fast Hilbert space-filling curve transformation using a LUT
MIT License
41 stars 3 forks source link

link to paper #12

Open andrewgazelka opened 1 week ago

andrewgazelka commented 1 week ago

Hello, can you please link to a paper/page that describes how the algorithm works? Thank you. I am trying to research cartesian → hilbert.

becheran commented 1 week ago

Hey, sorry for the late reply. I did not write a paper about it. Was just an idea that I came up with and the LUT that I found performed quite well in the end. Here is the only documentation that I have about how it works: https://docs.rs/fast_hilbert/latest/fast_hilbert/

Basically the idea is to store the state transition of a hilbert curve into a fixed LUT wich maps from SXXXYYY => SHHH Where S stands for State (2 bits required for all 4 states that exist) and the 3 XY bit combinations as input. The output is another state where you land on the state diagram (agin 2 bits) and the hilbert number bits which are always twi bits for each H.