This visualisation uses AI Generated code, finetuned for the best visualisation, not code quality

Interactive Raylib lab for comparing nearest-neighbour spatial data structures, with animated builds, live query traversal, and a movable code inspector linked to the current search state.

• How QuadTree and KD-tree structures partition the same point set differently
• How a nearest-neighbour query walks the structure and prunes space
• How presets and speed controls change the path you see on screen
• How the linked inspector connects visual traversal to source-level logic

flowchart LR
    A["Point Set"]
    B["Build Spatial Index"]
    C["Move Query Point"]
    D["Traverse Candidate Regions"]
    E["Prune Unneeded Branches"]
    F["Nearest Result"]

    A --> B
    B --> C
    C --> D
    D --> E
    E --> F

• q: quit
• a: switch algorithm
• p: cycle point presets
• r: reset the current build/query animation
• space: pause or resume
• mouse move: drive the nearest-neighbour query

make run