在算法中，所有的B3样条曲线的控制点可以通过对多边形的顶点简单计算产生。
The control points of the B3-spline to be constructed are computed simply by the vertices of the given polygon.
第一种算法的特点是重建结果不依赖于顶点的处理顺序，不需要进行控制顶点的初估及修正，可使各控制顶点的计算一次完成。
The first algorithm gives unique result unaffected by the handling order of points concerned, and it calculates the control vertexes at once without estimation and correction.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
应用推荐