Uses an algorithim to turn (x, y) coordinates (2D) into its corresponding value on the Hilbert Curve. It can also go from a singular value back to (x, y) as long as you know what grid it would be on. If you do not know what the grid size is, then it automatically finds the smallest grid size containing the value inputed. Grid sizes should be some length 2^n but the program will find the smallest n for 2^n that contains the size given.
-
Notifications
You must be signed in to change notification settings - Fork 0
MKR0902/HilbertCurveDimensionElevator
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Uses an algorithm to turn (x, y) coordinates (2D) into its corresponding value on the Hilbert Curve. It can also go from a singular value back to (x, y).
Resources
Stars
Watchers
Forks
Packages 0
No packages published