Concepts4
⚙️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
🗂️Data StructureAdvanced
Centroid Decomposition - Distance Queries
Centroid decomposition splits a tree into levels by repeatedly removing a centroid so that each remaining component is at most half the size.
#centroid decomposition#tree distance queries#nearest red node+12
🗂️Data StructureAdvanced
Centroid Decomposition
Centroid decomposition splits a tree around a special node (centroid) so that every remaining component has at most half the nodes.
#centroid decomposition#centroid tree#tree algorithms+11
🗂️Data StructureIntermediate
Segment Tree with Lazy Propagation
A segment tree with lazy propagation supports fast range updates and range queries in O(\log n) time.
#segment tree#lazy propagation#range update+12