Leetcode 612. Shortest Distance in a Plane

Given coordinates of geometric entities in 2D, compute the minimal Euclidean distance between them. This is a computational-geometry problem that typically requires efficient closest-pair/point-to-segment techniques (e.g., divide-and-conquer, sweep line, convex hull/rotating calipers) and careful handling of precision to meet time constraints.