Home▸Algorithms & AI▸The Closest Pair of Points Problem: A Classic Divide-and-Conquer Algorithm

📍 The Closest Pair of Points Problem: A Classic Divide-and-Conquer Algorithm

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.

Algorithms & AI3DModerate60 FPS

This simulation visually demonstrates how the divide-and-conquer algorithm splits a set of points, solves each half recursively, and checks the narrow strip near the dividing line to find the overall closest pair.

🔬 What It Demonstrates

🎮 How to Use

Add or generate points on the plane, then step through the algorithm to watch the recursive splitting, the strip formation, and the final closest pair get highlighted.

💡 Did You Know?

For a set of one million points, the divide-and-conquer algorithm can be millions of times faster than brute force, turning a computation that might take hours into one that finishes in a fraction of a second.

⚙ Under the hood

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.

algorithmscomputational geometrydivide and conquercomputer sciencedata structuresgeometrycollision detectiongis

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