1.
In [3], [6] Gruan Yingnan gave a branch-constructing algorithm for extreme vertices of the mixture convex polyhedron with lower and upper bounds and obtained a modified CONSIM algorithm for the mixuure convex polyhedron with multicompo-nent constraints.
在文[3]、[6]中,关颖男给出了混料试验中单、多分量的混料凸多面体的极端顶点算法。
2.
Height weighted average LOD algorithm based on vertex degree
基于顶点度的高程加权平均LOD算法
3.
Algorithm Improvement and Implementation of Using Smooth Groups to Generate Vertex Normals of 3DS Model
3DS模型中平滑组生成顶点法向算法改进及实现
4.
A New Polygon Filling Algorithm Based on Pertinence Between Point and Its Abutting Sides
基于顶点与邻边相关性的多边形填充算法
5.
The intermediate vertex positions are computed dynamically using interpolation schemes such as linear, Hermite curve, etc.
中间的顶点位置使用插值方法动态计算决定。
6.
Maximum Vertex Cover in Trees;
树上的最大顶点覆盖的算法设计和分析
7.
Quadric Error Metric Edge Collapse Algorithm Based on Vertex Degree;
基于顶点度的二次误差度量的边折叠算法
8.
An Algorithm for Minimum Vertex Cut Set of Partially Ordered Sets and the Problem of Minimum Cost of Crashed Tasks;
偏序集最小顶点割算法与最小费用赶工问题
9.
A Hybrid Genetic Algorithm for Solving Minimum Vertices Covering Problem
一种求解图最小顶点覆盖问题的混合遗传算法
10.
AN ALGORITHM FOR FINDING ALL THE SHORTEST PATHS BETWEEN THE VERTEXES IN A GRAPH
求图中顶点之间所有最短路径的一种算法
11.
A LOD Algorithm for Large Scale Ocean Based on OpenGL Index Vertex Array
基于OpenGL索引顶点数组的大尺度海面LOD算法
12.
Find the cosine of the angle between the vertex normal and the newly calculated vertex to light normal.
确定顶点法线与重新计算顶点后得到的光照法线之间的角度的余弦。
13.
Optimization algorithm for the measurement of vertex radius of aspherics with a swing-arm profilometer
光学非球面形摆臂式轮廓法测量顶点曲率半径优化算法研究
14.
Analysis and Research on Algorithm for All Vertices-constrained Shortest Paths;
求图中受顶点数限制的所有最短路径的算法分析研究
15.
The control points of the rational spline to be constructed were computed simply by the vertices of the given polygon.
在算法中，所有的有理样条曲线的控制点可以通过对多边形的顶点简单计算产生。
16.
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.
第二个算法不断删去多边形的凹点及新产生的凹点,最后得到凸壳顶点序列。
17.
A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper, which can be used for monitor-nodes selection in net traffic measurement.
提出了一种分布式求解弱顶点覆盖集的近似算法，用于网络流量有效测量点的选择。
18.
Affine Lie Algebra (?)_8 and Its Vertex Operator Algebra;
仿射李代数（？）_8及其顶点算子代数