全部

1·Takes all vertexes as initial population.

采用全部顶点做初始种群。

2·I then had to consider how to index the vertexes.

我当时不得不考虑如何索引的顶点。

3·The first big 3d issue was how to handle Vertexes, Texture coordinates and Indices.

三维的第一大问题是如何处理顶点，纹理坐标和指数。

4·The mapping simplex methodis used instead of the substitution of simplex vertexes.

用“映射单纯形”方法代替“单纯形顶点代换”方法；

5·Finally the rectangles' four vertexes coordinate through geometric constraints are solved.

最后利用几何约束求解出矩形模式特征的四个顶点。

6·Polygon vertexes algorithm and realization method is studied for blanking part optimal layout.

主要研究冲裁工件排样优化算法及实现问题。

7·Permutation function was defined to put the vertexes in AAG in certain order according to attributes of vertexes.

根据模型面的属性集定义排序函数，将属性邻接图的顶点按照一定的序列排列。

8·An algorithm for identifying the orientation of a polygon according to the sequence of extremity vertexes is proposed.

提出一种根据多边形各个极点在顶点序列中的先后顺序确定多边形方向的算法。

9·Traditionally, surface reconstruction is built directly by using reconstruction data, which control vertexes aren't compressed.

传统的逆向工程曲面重构方法是直接重构，即不对控制顶点进行压缩，直接利用重构数据。

10·Abstract: the concept of vectors of vertexes and their interaction were proposed to characterize the molecular structure of complicated samples.

摘要：提出顶点及顶点相互作用矢量的概念，并将该矢量用于复杂样本的分子结构表征。

顶点

1·I then had to consider how to index the vertexes.

我当时不得不考虑如何索引的顶点。

2·Nine PZT actuators are distributed among four platforms, and in each layer there are three PZT actuators placed on the vertexes of an equilateral triangle.

在四层平行平板间并列分布九个PZT微驱动器，每层的三个驱动器摆放在一个正三角形的三个顶点上。

3·At the same time the author points out that the polygon vertexes can be sorted clockwise or anticlockwise by judging the sign of the vector polygon area.

同时指出可以通过判断矢量多边形面积的正负值将多边形的顶点按照顺时针或逆时针方向排序。

4·The algorithm first describes the left image with DT mesh. As feature points, the vertexes of triangulations are matched in the right image for finding their corresponding points.

本文算法首先对立体图像对中的左图像进行DT网格剖分，把各三角形的顶点作为“特征点”在右图像中寻找它们的匹配点。

5·The optimum knots ordinate formula in the least square sense is derived by computing coefficient matrix and curve vertexes under the specified subsection knots abscissas conditions.

在给定分段节点横坐标的条件下，通过确定系数矩阵和反求曲线顶点，基于最小二乘法推导出最优节点的纵坐标公式。

(1)vertex angle顶角

(1)vertex power镜顶屈光度