📍 Closest Pair of Points in 3D: Divide and Conquer on a Blender-Built Board
Explore how the closest pair of points problem in computational geometry is solved efficiently using a divide-and-conquer algorithm that beats brute force for large point sets.
⚙ Under the hood
Watch divide and conquer find the closest pair of points on a Blender-built 3D board: median dividing blade, strip scan, brute-force comparison counts, click-to-add points and seven numerical self-checks.
algorithmscomputational geometrydivide and conquercomputer sciencedata structuresgeometrycollision detectiongis
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install