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

🎯 2D Greedy k-Center Core-Set Selection: Farthest-First Traversal, Covering Radius and the 2-Approximation Bound

Top view of greedy k-centre core-set selection for active learning: covering discs, farthest-point links, the r_k/2 optimum lower bound and a random-subset baseline, verified by brute-force optimum on small instances, a packing argument and scale equivariance.

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

Top view of greedy k-centre core-set selection for active learning: covering discs, farthest-point links, the r_k/2 optimum lower bound and a random-subset baseline, verified by brute-force optimum on small instances, a packing argument and scale equivariance.

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

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)