Search⌘ K
AI Features

Erect the Fence

Explore how to solve the Erect the Fence problem by learning to identify the convex hull that encloses all given points. Understand key geometric concepts and apply efficient algorithms to determine the shortest perimeter connecting all trees on a 2D plane.

Statement

You are given an array of points, trees, where trees[i] = [xᵢ, yᵢ] represents the location of a tree on a 2D plane. Your goal is to enclose all the trees using the shortest possible length of rope, forming a fence around the garden. A garden is considered well-fenced if every tree lies inside or on the boundary of the fence (i.e., the fence forms the convex hullThis is the smallest convex shape, completely encloses a set of points. of all the points).

Return the coordinates of the trees that lie exactly on the fence perimeter. You can return the answer in any order.

Constraints:

  • ...