vertices的例句大全

If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other, the graph G is said to be a quasi-strong edge colourings.

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

The adjacent vertex-distinguishing total coloring is the proper total coloring which demands the adjacent vertices with different color sets.

图的染色的基本问题就是确定其各种染色法的色数，图的邻点可区别全染色就是要求相邻顶点具有不同颜色集合的正常全染色。

The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.

邻点可区别关联着色的定义是在关联着色的基础上提出的，是使得相邻顶点的颜色集不同的关联着色。

Therefore the vertices and adjacencies of each vertex are computed in the offline phase. Then the online phase simply searches the adjacencies of the old solution vertex for the new one.

因此，这个凸多面体的所有顶点及每个顶点的相邻顶点都可在离线阶段求出，于是在线阶段只需在当前解的相邻顶点中搜索新的解。

Along with the direction change of the external wrench, the solution sequentially shifts from a vertex to one of its adjacencies, whereas the polytope with all its vertices remains unchanged.

随着外力旋量方向的变化，解不断地从一个顶点转移到它的一个相邻顶点，而凸多面体和它所有的顶点均保持不变。

For a given graph G of order n, a routing R is a set of n ( n-1) elementary paths such that every ordered pair of vertices in G are connected by a path in the set.

对于给定的n阶连通图G，一个路由选择R是指G中的n（n-1）条路集，其中每个有序点对都有路集中的一条路连接。

Calculation of Euclidean Distance between Vertices Based on VCC

图像顶点链编码和顶点欧氏距离的计算

The Wiener index is the sum of distances between all pairs of vertices in a ( connected) graph.

Wiener指数是连通图的点对的距离之和。

The Distributing of Terminals and the Property of Steiner Vertices on the Steiner Tree Problem MATCH POINT

Steiner树问题中正则点分布与Steiner点性质

Vertices are read from the vertex data stream and are sequentially processed by the shader function.

从顶点数据流中读出顶点后,就由着色器函数来对其进行处理.

A leading vertex is the first vertex in a sequence of three vertices.

引导顶点就是顶点序列中三个顶点的第一个.

Many meshes encountered in real data feature vertices that are shared by multiple polygons.

许多mesh会相交在一些被多个多边形共享的顶点上.

They are polygons, specified by the coordinates of a centre of mass and their vertices.

它们均由多边形表示, 并给定其重心和各顶点的坐标.

An octahedral tessellation approximates a spherewith an octahedron whose vertices are all on the unIt'sphere.

八面体三角化把球面近似于一个顶点在单位球上的八面体.

We can manipulate the vertices without locking, but we'll discuss that later.

我们可以操作这些顶点而不用锁定, 不过我们将在以后讨论.

The reduction of vertices goes hand in hand with the loss of equal number of normals.

顶点的减少将同时引起相同数量的法向量减少.

G is geodetic if every pair of vertices is connected by a unique shortest arc.

如果图G上 的任意两点都有唯一的最短路相连,则我们称图G是测地图.

Draws a single , convex polygon . Vertices 1 through N define this polygon.

画一个凸多边形. 顶点1到n定义一个多边形.

Each information bit was embedded by modifying the difference of two adjacent vertices.

通过修改相邻顶点坐标的差值来实现数据隐藏.

These new vertices, which are adjacent to level 1 vertices, and so on.

这些新的顶点, 这是毗邻的第1级的顶点, 等等.