Concepts2
⚙️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
Euler Tour Tree
An Euler Tour Tree represents each rooted tree as a DFS open/close sequence so that every subtree is a single contiguous interval.
#euler tour tree#implicit treap#dynamic forest+11