Thirdly , from the idea of locally linear approximate , another tangent - plane algorithm is presented for the distance between the convex nurbs surfaces . the critical step is the construction of the support mapping by gjk and lc to search for nearest points , and emphases are laid on dealing with isotropic cases and choosing initial iterated points . it is also proved that no isotropism during iteration would take place if initial iterated points are positive points 切平面法是运用gjk和lc构造支撑映射的原理而设计的一个搜索近点对的迭代法，着重给出了迷向情况的处理和初始迭代点的选取方法，并证明了只要将初始迭代点取为阳点，就不会出现迷向情况。
您当前位置：