vertices

How much world-space movement of the character will affect cloth vertices.

在世界空间角色有多少移动，将影响布料顶点。

In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.

在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。

A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices.

图中经过三个以上顶点且经过每个顶点仅一次的一条封闭路径。

Single selected vertices which do not belong to selected edges are duplicated and a new edge is created between the two.

如果选择点，那么他将在新点与原始点之间生成边。

These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices.

这些新的顶点介绍，以减少总长度的连接被称为斯坦纳点或施泰纳顶点。

How much world-space acceleration of the character will affect cloth vertices.

在世界空间角色有多少加速度，将影响布料顶点。

For a graph G, f is a strong edge coloring if it is proper and any two vertices are incident with different sets of colors.

如果图G有一个合理边上色，使图G的所有相邻顶点的关联边上色集合都互不相同，则称图G为准强边着色。

There were twenty rooms, each connecting to three others, arranged like the vertices of a dodecahedron (or the faces of an icosahedron).

其中有20个房间，每个房间与另外三个相连接，排列像一个dodecahedron的顶点（或者是一个icosahedron的面）。

if two edges of a graph are incident to the same pair of vertices , then these two edges are called parallel edges.

如果一个图的两条边关联于同一对顶点，则这两条边称为平行边。

of an unknown point, as in navigation, by the formation of a triangle having the unknown point and two known points as the vertices.

三角测量通过以分别作（顶点）的两个已知点和一个未知点形成一个三角形，来求出或定位该未知点，如在航海中。

In the front view, select the two rows of vertices shown in the image.

在前面视图中，选择在图中显示的顶点的两行。

The top vertex in the queue was to be folded first and updated the vertices which were affected, then the queue was sorted again.

每次选择队首顶点向其折叠点合并，并且更新队列中受影响的顶点信息，再对队列重新排序。

Whenever the count of a vertex drops to zero, that vertex can be placed onto a list of vertices with a zero count.

每当一个顶点计数下降到零，即顶点可以放置到一个顶点清单零计数。

Still in the front view, use the Move tool to shift the selected vertices a few units lower.

还是在前面视图中，使用移动工具移动所选顶点少数单位为低。

objects on the screen with polylines. A polyline is a graphics programmer's term for a multi segment line defined by an array of vertices.

许多程序在屏幕上画出的对象呈折线形，折线是绘图程序的专用术语，专指由一系列顶点定义的多段线条。

The result would be a graph with the minimum number of edges necessary to connect the vertices.

执行这种算法的结果就是产生了一个图，它用最少的边连接了所有的顶点。

Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.

最佳解通常都是其可行域所构成的多面体的一个顶点。

Flip the order of triangle vertices so that the system traverses them clockwise from the front.

颠倒三角形顶点的顺序，这样系统可以从正面沿顺时针的方向去遍历他们。

Graphics hardware processes vertices in a pipeline like a factory builds cars in an assembly line.

图形硬件是以流水线形式处理顶点的，就像工厂以流水线组装汽车一样。

Lastly, on the basis of boundary search in the directions of each edge, all the vertices on the feasible region can be directly attained.

最后根据偏移多边形各边的方向，通过沿边界搜索直接获得可行域上的各点。