顶点

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

Furthermore,we present the method for designing quadratic Bezier developable surface:give four corner points of developable surface and two free designing parameters,the other two control vertexes are on the line connecting the linear interpolation point between the first two control vertexes and the linear interpolation point between the last two control vertexes,and they are the linear interpolation points between these two linear interpolation points respectively,namely,these four linear interpolation points are colinear.

提出了二次Bézier可展曲面的设计方法：给定可展曲面的4个角点a0、b0、a2、b2和两个自由设计参数？姿、？滋，则待求的2个控制顶点a1、b1是在前2个控制顶点a0、b0的线性插值点a*与后2个控制顶点a2、b2的线性插值点b*的连线上，并且也是a*、b*这2个线性插值点的线性插值，即这4点a*、a1、b1、b*共线。

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从透镜的表面到焦点的距离被称为顶点焦距，是以透镜的前后顶点为起点测量的。与之相对应的屈光度称为前后顶点焦度。

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 有三种的顶点处理方式：软件顶点处理、硬件顶点处理和同一设备的混合顶点处理。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

A graph G is called*-choosable if for every list assignment L satisfying L=k for all v 6 V, there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself.

若对任一顶点给定k种颜色的列表，染色时每个顶点的颜色只能从自身的颜色列表中选择且每个顶点至多有d个邻点染相同的颜色，总存在图G的一个顶点的正常着色，则图G称为~*-可选色的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。

This finds all the edges satisfying the condition that the first vertex index is less than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

当从第一个顶点到第二个顶点的方向表示该边所属三角形的逆时针方向时找到所有符合第一顶点的索引比第二个顶点索引小的边。

Graf, without question, is the greatest women's player in history.

格拉芙，现在，毫无疑问是女子网坛历史上最伟大的选手。

If not, you will have to look around at all your important data.

如果没有，您将需要检查所有的重要数据。