Convex Package Summary

The knowledge about convex hull is not difficult to understand, and a little look can understand the process and principle of convex package.

1. What is a convex bag?

In a real vector space V, for a given set X, all the intersection s of the convex sets that contain x are called convex packages of x. (from Baidu Encyclopedia)

In layman's terms, convex hull is a convex polygon which can be included in all the points in the plane. Put a picture to understand, the red border in the picture is a convex hull.

2. How do I achieve this?

The implementation of convex hull is actually very simple. First find the bottom point in the plane (that is, the point at the bottom of the y-coordinate) u, which is definitely on the convex hull. The poles are then sorted by this point. What is the polar sort, the polar sort is sorted from small to large based on the slope of a line connected to a point u?

Waiting for Updates ~

Convex Package Summary