Home▸AI & Machine Learning▸3D Greedy k-Center Core-Set Selection: Farthest-First Traversal, Covering Radius and the 2-Approximation Bound

🎯 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.

AI & Machine Learning3DModerate60 FPS📱 Mobile-adapted🟠 Blender⇄ 2D version
3D Greedy k-Center Core-Set Selection: Farthest-First Traversal, Covering Radius and the 2-Approximation Bound ↗ Open standalone
⚙ Under the hood

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.

Core-Set SelectionActive Learningk-CenterFarthest-First TraversalCovering RadiusApproximation AlgorithmData Subset SelectionEmbedding Space

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)