顶点的

A hierarchy and circularity of data structure was presented by analyzed STL files and compared a several of frequently used data structures. The structure acquired from redundancy vertex was filtered by vertex sequence of quick sort, and vertex adjacent list and triangle face adjacent list was established.

通过对STL文件的分析和几种常用数据结构的比较，给出了一种层次环状数据结构，该结构是由快速排序顶点序列进行冗余顶点滤除，并建立顶点邻接表和三角面片邻接表而得到的。

This algorithm is proposed on the basis of the thought as follovvs: as for three dimensional Euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter.

如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱——它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。

These are called vertex focal distance because they are measured from the vertex of the lens surface to the lens focal point, The focal powers corresponding to them are the back and front vertex powers.

13从透镜的表面到焦点的距离被称为顶点焦距，是以透镜的前后顶点为起点测量的。与之相对应的屈光度称为前后顶点焦度。

More precisely,we shall say that two graphs are isomorphic if there is a one-one correspondence between their vertices which has the property that two vertices are joined by an edge in one graph if and only if the corresponding vertices are joined by an edge in the other [3],Another graph isomorphic to the graphs in Figs.

更准确地说，如果两个图的顶点间存在一一对应，使得在一个图中有一条边连接两个顶点在另一个图中相应也有且仅有两个对应顶点由一条边相连，则说这两个图是同构的。

As far as I know, there are two vertex shader assemblers: the Microsoft vertex shader assembler and the NVIDIA vertex and pixel shader macro assembler.

至于我所知道，这有两个顶点着色的汇编程序：Microsof的顶点着色汇编程序及NVIDIA顶点/象素着色宏汇编程序。

In Microsoft DirectX 9.0, the HAL can have three different vertex processing modes: software vertex processing, hardware vertex processing, and mixed vertex processing on the same device.

在 Microsoft DirectX 9.0 中，HAL 有三种的顶点处理方式：软件顶点处理、硬件顶点处理和同一设备的混合顶点处理。

A directed graph, or digraph G consists of a finite nonempty set of vertices V, and a finite set of edges E, where an edge is an ordered pair of vertices in V.

有向图，或图克组成的有限非空子集的顶点V和有限的一套边英，那里的优势是下令对顶点在五顶点也称为节点。

The algorithm deals with the points of the vertex chain code around a region,matches points in the same scan lines and uses scan lines to fill the region,and then the binary image will be reconstructed.

该算法对表示二值图像区域的顶点链编码点进行记录处理，配对被记录的顶点链编码点，然后运用水平扫描线来填充图像区域，从而将原图像根据顶点链编码完全恢复出来。

Ok ... now we have learned how to check the supported version number of the vertex shader hardware, how to declare a vertex shader and how to set the constants in the constant registers of a vertex shader unit.

好了。。。我们现在已经学会了如何检测系统支持的顶点着色器的版本号，如何宣告一个顶点着色器及如何在一个顶点着色单元内的常量寄存器中设置常量。

The original STL model is progressively reorganized into a structured triangle mesh by using half edge pointers and hash table indexing to linking adjacent triangles. All redundant vertices are eliminated and at the same time the topology of triangle mesh is set up.

首先通过半边匹配确定新增三角片的类型；然后针对每一种类型使用不同的方法去除冗余顶点，并同时建立拓扑关系；最后通过顶点数组紧缩消除顶点空隙，将半边hash表转化为半边数组，完成网格模型的重建。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。