Conformal geometric algebra for spherical convex hull
Xuehui Zhang, Li Ma · 2011
For a given number of points on the plane, find a minimum set of points even as a convex polygon, which is one of the classic problems of computational geometry. The traditional method is to determine the relationship between point and polygon, the algorithm is less efficient. Based on the research of traditional algorithm ,analysis of one-step, and puts forward the use of conformal geometric algebra to the problem of solving spherical convex optimization. Geometric algebra can determine optimal point and polygon point for judging the position circle relationship with that simple and high efficiency.