Task: Implement a 2D Concave Hull Algorithm
Task: Implement a 2D Concave Hull Algorithm: a task in Terminal-Lego-15k (Harbor dataset). Implement an efficient algorithm to generate a 2D concave hull (also known as an alpha shape or non-convex boundary) from a set of 2D points. Given a set of points and a maximum edge length parameter, the…
The task
Implement an efficient algorithm to generate a 2D concave hull (also known as an alpha shape or non-convex boundary) from a set of 2D points. Given a set of points and a maximum edge length parameter, the algorithm should produce a polygon that represents the concave boundary of the point set.
Part of PrimeIntellect/Terminal-Lego-15k.