第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。
The second algorithm is that polygonal concave points and newly created concave points are continuously removed, and a vertex sequence of the convex hull is finally obtained.
第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。
The control points of the rational spline to be constructed were computed simply by the vertices of the given polygon.
第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。
The control points of the rational spline to be constructed were computed simply by the vertices of the given polygon.
应用推荐