查询词典 vertices

Then, the bilinear spatial transformation equations are solved according to the mapping between the four vertices of a distorted plate image and its normalized vertices, so as to correct the distorted plate image.

然后，根据畸变牌照的4个顶点和归一化汽车牌照图像的4个顶点之间的一一对应关系，求解双线性空间变换方程，进而对畸变图像进行校正。

A graph is said to be equitably -colorable if the vertices of is colored with colors such that there are no two adjacent vertices of the same color and the size of the color classes differ by at most one.

如果图上的点可以用个颜色来著色使得相邻的点著不同的颜色且颜色类的大小差最多是1，我们就说这个图是可均匀著色。

Despite the fact that default expressions such as vertices.first are ill-formed for the given graph arguments, both calls will compile, and each one will print exactly the same thing.

类似 vertices。first 的默认表达式对例子中给定的 graph 参数来说是完全非法的，调用或者编译都是，但是上面的例子却会完整地打印出传入的参数。

More precisely,we shall say that two graphs are isomorphic if there is a one-one correspondence between their vertices which has the property that two vertices are joined by an edge in one graph if and only if the corresponding vertices are joined by an edge in the other [3],Another graph isomorphic to the graphs in Figs.

更准确地说，如果两个图的顶点间存在一一对应，使得在一个图中有一条边连接两个顶点在另一个图中相应也有且仅有两个对应顶点由一条边相连，则说这两个图是同构的。

It is shown that every minimum geodetic set of a graph does not contain its cut-vertices, and if G is a block graph with n≥3 vertices and k≥1 cut-vertices,then g=n-k.

图的每个最小测地集都不包括它的割点，如果图G是一个有n≥3个顶点，k≥1个割点的块图，那么g=n-k。

For any two vertices u and v of a graph G, a u-v geodesic is the shortest path between u and v. The set I consists of all vertices lying on a u-v geodesic. For SV, I is the union of all sets I for vertices u, v∈S. The geodetic number g is the minimum cardinality among the subsets S of V with I=V.

对于图G内的任意两点u和v，u-v测地线是指在u和v之间的最短路。I表示位于一条u-v测地线上所有点的集合，对于SV，I表示所有I的并，这里u，v∈S，G的测地数g是使I=V的最小点集S的基数。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。

To ensure accurate results you'll want to make sure that the vertices are queried in render order.

如果你希望获得正确的法向量，一定要确定vertices的顺序是按照渲染顺序排列的

The light intensity will affect all vertices within the range of the light source.

光线的紧密可以影响所有的vertices包括光源的范围。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。