vertices的例句大全

The component we collapsed had at least two vertices.

我们毁掉的分支至少有两个顶点.

When a bone moves, the vertices attached to it also move.

当骨头移动时, 纳入它的顶点也随之移动.

A polyline in this drawing has too many vertices for conversion.

此绘图中的折线具有太多要转换的顶点.

Let u and v be nonconsecutive vertices on c.

设u和v是c上不相邻的两个顶点.

Every graph has at least two vertices of same degree.

众所周知,任意顶点数大于1的图至少有两个点的度数相同.

Polyhedra with seven vertices are rare.

具有七个顶点的多面体是稀少的.

Can I share position data between vertices with different texture coordinates?

我能够对于有不同纹理坐标的顶点共享相同的位置数据 吗 ?

These vertices, however, may not be distinct, as in the case where the endpoints may coincide.

但这两个顶点不一定是不相同的, 譬如在两个端点重合时的情况.

Create surfaces. We use early created arrays as a set of vertices.

创建表面. 我们用之前建立好的数组作为顶点的设置.

No control over the vertices once it enters into the pipeline.

程序员无法控制进入管道内的顶点.

NB: a diagonal is a straight line joining two vertices not on the same side.

注: 对角线是连接两个不在同一边上的顶点的直线.

A circ is an undirected graph having only vertices of even nonzero degree.

一广义圈是一无向图,其顶点次数都是非零偶数.

Alice wins the game if all vertices of the graph are legally colored , otherwise Bob wins.

否则,Bob赢.

Once finished, we continued making the body extruding faces and modifying the vertices.

一旦结束, 我们继续开始通过挤压面和修改点来制作身体.

All the interior vertices are connected to exactly three vertices each.

所有三角形内的顶点恰好与三个顶点相联结.

A high-efficient algorithm to seek the shortest path arborescence and all shortest paths between any two vertices in DAG is presented.

无回路网络是一类重要的网络，给出在无回路网络中求解最短路树形图和任意顶点对间最短路的高效算法。

Removes the selected vertex from the curved line and reconnects the line between the two adjacent vertices

删除曲线上所选顶点并重新连接相邻两顶点间的线条

Let DKv denote the symmetric complete directed graph with v vertices, the covering number C ( v, m) is a minimum number of covering DKv by m-circuits.

设DKv表示完全有向对称图，C（v，m）表示覆盖DKv的m长有向圈的最小圈数（称为覆盖数）。

The dual bandwidth of a graph G, denoted by ( G), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

Based on the idea of statistics on the struc-ture, the clique histogram represents the distribution of one vertex with respect to its adjacent vertices, which can capture statistical information on the vertex level.

采用对结构进行统计的思路，首先定义团直方图来表示图的顶点到其邻接顶点之间的分布，捕捉顶点层次上的统计信息。