Points

Jan 24, 2025 Engineering

Closest Pair of Points: Divide and Conquer

The closest pair of points problem asks a deceptively simple question: given n points in a plane, which two points are closest to each other? You’re measuring Euclidean distance—the straight-line…

Jan 13, 2025 Engineering

Articulation Points: Finding Cut Vertices in Graphs

An articulation point (also called a cut vertex) is a vertex in an undirected graph whose removal—along with its incident edges—disconnects the graph or increases the number of connected components….