Leetcode 1924. Erect the Fence II

Given a set of 2D points, compute the smallest convex polygon (fence) that encloses all points and return all points that lie on its boundary, including collinear and duplicate cases; this is a computational-geometry problem requiring a robust convex-hull algorithm that handles precision and edge cases efficiently.