Because one vertex can only have one normal, you must duplicate the vertices as well.
由于一个顶点只能有一条法线，所以你还要复制顶点。
The three vertices of the iron triangle collapse into one vertex of the Agile triangle called constraints.
传统铁三角的三个顶点转变为“敏捷三角形”的一个顶点，被称为约束。
The constructor of VertexArray takes the number of vertices (eight), the number of components per vertex (x, y, z), and the size of each component (one byte).
VertexArray构造函数中保存了顶点数量(8个)、各顶点的组件数(x,y,z)以及各组件的大小(1字节)。
Vertices are read from the vertex data stream and are sequentially processed by the shader function.
从顶点数据流中读出顶点后，就由着色器函数来对其进行处理。
Smooth - Smooths out a mesh by moving each vertex towards the barycenter of the linked vertices.
光滑-通过向连接顶点的重心移动每个顶点来光滑一个网格物体。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Vertex Lit path generally renders each object in one pass, with lighting from all lights calculated at object vertices.
顶点照明渲染路径通常在一个通道中渲染物体，所有光源的照明都是在物体的顶点上进行计算的。
Their main drawback is the prediction only reduces the correlation between each vertex and its neighboring vertices in the traversal path.
其主要缺点是只利用了遍历路径上的相邻顶点来进行预测，并没有充分去掉顶点间的相关性。
CPU has too many vertices to process, for things that do vertex processing on the CPU. This could be skinned meshes, cloth simulation, particles etc.
CPU处理太多的顶点——针对CPU处理顶点的情况。这可能是蒙皮网格、衣服模拟、粒子等。
Goal - The default goal weight for all vertices when no Vertex Group is assigned.
目标-没有顶点组被分配时，默认的目标权重是为所有的顶点。
The vertices created here provide the horizontal vertex positions.
这里新建立的顶点提供横向顶点。
A directed rooted tree refers to a directed tree which has one vertex with out-degree 0 and all the other vertices with out-degree 1.
有向根树就是只有一个顶点的出度为0，其余顶点的出度均为1的有向树。
In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.
在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。
The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
How many vertices are "ok" depends on the GPU and the complexity of vertex shaders.
到底多少个顶点是ok的，依赖于具体的GPU设备和顶点着色器的复杂度。
This algorithm removes vertices of the mesh according to the curvature of the vertex weighted by the area of the triangles which are adjacent to that vertex.
对于网格模型简化问题，本文提出了一种基于网格顶点曲率加权该顶点邻接三角形面积的顶点删除简化算法。
Besides, since this algorithm does not need the information of the topological relation among vertices, it could be applied to any geometrical models with vertex information.
此外，由于算法过程无需顶点的拓扑连接关系信息，本文算法适用于具有顶点信息的任意几何模型。
The top vertex in the queue was to be folded first and updated the vertices which were affected, then the queue was sorted again.
每次选择队首顶点向其折叠点合并，并且更新队列中受影响的顶点信息，再对队列重新排序。
Vertex positions (may include normals also) for all the vertices in the mesh for all the animation frames are stored in memory.
动画帧所有网格顶点包含着顶点的位置(可能包括法线)其全部储存在内存中。
The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.
邻点可区别关联着色是使得相邻顶点的颜色集不同的关联着色。
Earlier I said to remember the fact that the vertex code specified the vertices around the origin.
前面，我说过要记住顶点是相对于原点来定义的。
Earlier I said to remember the fact that the vertex code specified the vertices around the origin.
前面，我说过要记住顶点是相对于原点来定义的。
应用推荐