Practical Fractals in Space

on YouTube ↗38m

" summary

Argues that space‑filling curves truly map multi‑dimensional keys into a single order that preserves locality and gives concrete implementations: bit interleaving for Morton (Z-Order), gray‑code + rotations for Hilbert, worked examples and code in Julia+Gadfly. Compares tradeoffs (Morton is simple but makes large jumps, Hilbert gives better locality at higher implementation complexity), shows a 3D print, cites SLURM’s hilbert.c and use cases: navigation, image search, collision detection.

AI-written summary · about

" chapters (5)

1. 0:00Start
2. 2:49Logistic Map in C++
3. 25:32properties of fractals
4. 32:36Collision Detection
5. 34:432D is easier for our brains to handle.

" related talks

• 25mMulti Dimensional Clustering with Z OrderingRussell Alexander Spitzer · Scale By the Bay 2021
• 12mGenerating fractals … with SQL queries!!!Michael Malis · !!Con West 2019
• 48mA Helicopter Tour of Purely Functional Data StructuresTyler Prete · LambdaConf 2019
• 43mResizable SketchesRasmus Pagh · Sketching and Algorithm Design 2023
• 41mExotic Functional Data Structures: Hitchhiker TreesDavid Greenberg · Strange Loop 2016
• 01mScale By the Bay 2021 intro video by Russell SpitzerRussell Alexander Spitzer · Scale By the Bay 2021
• 13mInterpolation Search Can Be Fast, in Some Situations, Sometimes, If You Try!Ruchir Khaitan, worse Irish · !!Con 2017
• 52mData Over Code: A Short HyperboleNorbert Wojtowicz · DevConf 2019