🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
🧩Problems🎯Prompts🧠Review
Search

Concepts2

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#nearest neighbor
⚙️AlgorithmAdvanced

Voronoi Diagram and Delaunay

Voronoi diagrams partition the plane so each region contains points closest to one site, while the Delaunay triangulation connects sites whose Voronoi cells touch.

#voronoi diagram#delaunay triangulation#fortune algorithm+12
⚙️AlgorithmIntermediate

Closest Pair of Points

The closest pair of points problem asks for the minimum Euclidean distance between any two points in the plane.

#closest pair of points#divide and conquer#plane sweep+11