how i rendered 1 million songs on the browser with webgl (wip). client side handles only point rendering but requires server for song's metadata.
-
Updated
Mar 15, 2026 - JavaScript
how i rendered 1 million songs on the browser with webgl (wip). client side handles only point rendering but requires server for song's metadata.
🎨 Fast hierarchical agglomerative clustering powered by WebAssembly
Fast static Hilbert kd-tree experiment
Javascript Version of Rednaxela's KdTree
TSP Solve Frontend
A micro JS library for building K-Dimensional Trees with N-Nearest Neighbours Search.
Ripple Insertion (Recursive Cheapest Insertion) is an experimental algorithm designed for Dynamic Traveling Salesperson Problem (TSP) scenarios. Unlike traditional solvers that calculate a route from scratch, this algorithm specializes in integrating new points into an existing route in real-time, optimizing locally via a cascading "ripple" effect.
My take on Craig Reynold's Boid Simulation. Press 'D' to see a real-time visualization of the underlying 2D-Tree.
A very fast spatial index for 2D points based on a Z-Order space filling curve and BIGMIN search space pruning
A very fast spatial index for geographic locations based on a Z-Order space filling curve
An implementation of the KD tree in javascript
Example implementation of VectorMap-Index for laptop recommendation using KD-Tree + local hash + Ollama embeddings.
Add a description, image, and links to the kd-tree topic page so that developers can more easily learn about it.
To associate your repository with the kd-tree topic, visit your repo's landing page and select "manage topics."