🎯 3D Greedy k-Center Core-Set Selection: Farthest-First Traversal, Covering Radius and the 2-Approximation Bound
A Blender-built slate table where every unlabelled embedding point is a pole whose height is its distance to the nearest chosen centre: greedy farthest-first traversal plants a brass pin on the tallest pole each step, the covering radius shrinks, and the 2-approximation bound is checked against brute force, packing and random subsets.
A Blender-built slate table where every unlabelled embedding point is a pole whose height is its distance to the nearest chosen centre: greedy farthest-first traversal plants a brass pin on the tallest pole each step, the covering radius shrinks, and the 2-approximation bound is checked against brute force, packing and random subsets.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install