vertices
美 [ˈvɜrˌteks] 
英 [ˈvɜː(r)teks]
- n.【几】顶(点)；【解】颅顶；【天】天顶；绝顶
- 网络顶点；顶点数；绘制顶点
词形变化
复数：vertexs 复数：vertices 复数：vertexes 反义词
同义词
英汉解释
英英解释
例句
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.
最后根据偏移多边形各边的方向，通过沿边界搜索直接获得可行域上的各点。
It is easily seen that for every graph the vertices can be ordered in such a way.
显而易见对于每个图，可用这种方法把其顶点编上号。
These shortest paths can be easily determined by keeping track of the predecessors of vertices in the tree.
只要在树中沿着先行顶点的轨迹引伸，这些最短路径还是容易确定的。
The condensation of D is a directed graph with m vertices.
D的凝聚图是指一个有m个顶点的有向图。
Let u and v be nonconsecutive vertices on c.
设u和v是c上不相邻的两个顶点。
Adjoin two new vertices X and Y to N.
在N中添加两个新顶点X和Y。
Euler's formula for the number of vertices, edges, and faces of any polyhedron.
欧拉公式有多少个顶点，边，并面临任何多面体。
All vertices are clipped by the front plane of the viewing frustum.
所有顶点都被视图截锥的前平面所剪辑。
Enabling this option will spawn particles on and in-between vertices, essentially all over the mesh's surface (seen below).
启用此选项粒子将产生在顶点上且在顶点之间，基本上全部是在网格的表面（如下图）。
A line segment that joins the center of a regular polygon with any of its vertices.
将正多边形的中心与它的一任一顶点起的来的线段。
Processing provides much more complex means of constructing objects using vertices.
Processing提供了更复杂的使用顶点创建对象的方法。
Merge - Merges selected vertices into a single one, at the barycenter position or at the cursor position.
合并-合并选择的顶点为一个单点，这个合并的点在重心位置或光标位置。
There may be several Steiner trees for a given set of initial vertices.
可能有几个斯坦纳树为一组给定的初始点。
Object that identifies the type of resources used for processing vertices.
对象，它标识用于处理顶点的资源的类型。
It is easily seen that for every graph the vertices can be ordered in such a way.
显而易见对于每个图，可用这种方法把其顶点编上号。
Since soft body vertices are considered as particles they interact with all the forces applied to particles in the layer.
因为软体顶点是考虑粒子与所有力场相互影响，粒子被应用在层里。
The next step is to draw all the triangles as specified in the triangle. vertices file.
下一步是像triangle.vertices文件中指定的一样绘制所有三角形。
Represents a custom vertex format structure that contains transformed vertices and one set of texture coordinates.
表示一种自定义顶点格式结构，它包含已转换的顶点和一组纹理坐标。
Because one vertex can only have one normal, you must duplicate the vertices as well.
由于一个顶点只能有一条法线，所以还要复制顶点。
A circle that is drawn around the outside of a triangle and contains all the vertices of the triangle.
在三角形外部画的一个圆，包含了三角形的三个顶点。
And put them in a buffer just as we did with the vertices and indices.
如同顶点及顶点顺序数组一样，将它们放入字节缓冲中。
To sculpt the the hair, I added 3 subdivision levels and used the SnakeHook brush to pull softly the vertices from the surface.
为了雕刻头发，我细分了3级然后用SnakeHook笔刷轻轻的从表面的顶点拉。
edge A line along which two planes of a solid figure meet, Also, on a graph, a line joining two nodes or vertices.
棱两个立体图形的面相交所得到的线。这个词也用于在一个图中表示联结两个顶点的线。
Subdivide - Each selected edge is split in two , new vertices are created at middle points, and faces are split too, if necessary .
每个选择的边一分为二，新的顶点将创建在边的中心；面也是一分为二。
Gets the type of resources used for processing vertices.
获取用于处理顶点的资源的类型。
The correct number of vertices is read out of the vertex buffer.
开始，从顶点缓冲区中读取正确数量的顶点。
