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.
開始，從頂點緩沖區中讀取正確數量的頂點。
