vertices
英 [ˈvɜːtɪsiːz]
美
n. (三角形或锥形的)角顶; 顶点; 至高点
vertex的复数
双语例句
- Processing provides much more complex means of constructing objects using vertices.
Processing提供了更复杂的使用顶点创建对象的方法。 - Similarly, adding polylines ( lines with multiple vertices) requires storing some data.
同样地，添加polyline（具有多个顶点的线）需要存储一些数据。 - Both Face objects have four vertices, but you can create a Face with any number of points.
这两个Face对象都有4个顶点，但实际上可以创建有任意个点的Face。 - A circle that is drawn around the outside of a triangle and contains all the vertices of the triangle.
在三角形外部画的一个圆，包含了三角形的三个顶点。 - Drag to add a triangle with independently adjustable vertices. Alignment box can be shown or hidden.
拖动此形状，可添加顶点可独立调节的三角形。可显示或隐藏对齐框。 - You would easily select vertices with paint select tool.
你会很容易地选择工具顶点，油漆选择。 - Create a new Vertex Group, and set Weight to 0. Select all vertices, and press Assign.
创建一个新的顶点组，和设置权重到0.选择所有的顶点，点击分配。 - Goal-The default goal weight for all vertices when no Vertex Group is assigned.
目标-没有顶点组被分配时，默认的目标权重是为所有的顶点。 - Graph: a graph is composed of a set of vertices and a set of edges.
图表：图表是由一组顶点和一组边构成的。 - All the interior vertices are connected to exactly three vertices each.
所有三角形内的顶点恰好与三个顶点相联结。 - The three vertices of the iron triangle collapse into one vertex of the Agile triangle called constraints.
传统铁三角的三个顶点转变为“敏捷三角形”的一个顶点，被称为约束。 - There is a difference in how each API handles how vertices are combined to form primitives.
有一个在每个API如何处理顶点是如何组合成原语的差异。 - A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.
一个构形是面图的一连串连通的顶点与这些顶点的度。 - A circ is an undirected graph having only vertices of even nonzero degree.
一广义圈是一无向图，其顶点次数都是非零偶数。 - Edge is a line between two vertices.
边是一个在两个顶点之间的线。 - If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.
如果边都是顶点的有序对，则得到有向图和有向重图的概念。 - Two vertices are said to be adjacent to one another if they are connected by a single edge.
如果两个顶点被同一条边连接，就称这两个顶点是邻接的。 - A polyline in this drawing has too many vertices for conversion.
此绘图中的折线具有太多要转换的顶点。 - Adjoin two new vertices X and Y to N.
在n中添加两个新顶点X和Y。 - Transforming an edge affects all connected vertices, faces and polygons.
改变一个边会影响到所有与之相联系的顶点、面、多边形。 - Therefore, effective and efficient methods for computing similarity between vertices across different graphs are still expected.
如何高效地计算两个图之间的相似度的方法仍有待研究。 - Up to isomorphism, there is just one complete graph on vertices.
在同构意义下，几个顶点的完全图只有一个。 - Subdivide Multi Fractal-As above, but new vertices are randomly displaced within a user-defined range.
不规则多次细分-与上一样，但它是在用户定制的范围内随机置换细分。 - They are polygons, specified by the coordinates of a centre of mass and their vertices.
它们均由多边形表示，并给定其重心和各顶点的坐标。 - The vertices created here provide the horizontal vertex positions.
这里新建立的顶点提供横向顶点。 - Polyhedra with seven vertices are rare.
具有七个顶点的多面体是稀少的。 - Smooth-Smooths out a mesh by moving each vertex towards the barycenter of the linked vertices.
光滑-通过向连接顶点的重心移动每个顶点来光滑一个网格物体。 - We can manipulate the vertices without locking, but we'll discuss that later.
我们可以操作这些顶点而不用锁定，不过我们将在以后讨论。 - Recalculate the bounding volume of the mesh from the vertices.
重新计算从网格包围体的顶点。 - Merge-Merges selected vertices into a single one, at the barycenter position or at the cursor position.
合并-合并选择的顶点为一个单点，这个合并的点在重心位置或光标位置。