Introduction - If you have any usage issues, please Google them yourself
The core idea of the code is to first take the safe distance beyond one meter into account by binary, then remove some noise points by open operation(this later found to be not necessarily necessary), and find all obstacles in the convex packet. At this time, we must calculate the area. When the area is less than a certain threshold, the convex packet coordinates of the obstacle are eventually output