Based on the set of points provided, this creates and assigns the points property using the convex hull algorithm. Removing all unneeded points. See Geometry.convexHull2d for details.
The polygon's list of vertices. Can be in either clockwise or counterclockwise order.
Construct a new instance of ConvexPolygonShape2D. Note: use memnew!ConvexPolygonShape2D instead.
Convex polygon shape for 2D physics.
A convex polygon, whatever its shape, is internally decomposed into as many convex polygons as needed to ensure all collision checks against it are always done on convex polygons (which are faster to check). The main difference between a ConvexPolygonShape2D and a ConcavePolygonShape2D is that a concave polygon assumes it is concave and uses a more complex method of collision detection, and a convex one forces itself to be convex in order to speed up collision detection.