顶点

When you are satisfied with it, use the grabber to move the vertices up a bit.

缩放到满意的效果后，使用grabber来移动该顶点上一点。

The graph vertex coloring problem is the main topic of graph theory and applied in many fields, which is known as NP-complete problem.

图顶点着色问题存在于丰富的科学和工程应用中，如工序问题、排课表问题、物资储存问题等等，但它却是众所周知的NP-完全问题。

In the third section of this paper, on the comprehensive study of some properties of proper k-vertex-coloring、 k-edge-coloring、 and total-coloring of a graph, the standard genetic algorithm for graph coloring is researched.

在本文的第三章节中，在系统分析了图的正常k－顶点着色、k－边着色和全着色问题的基础上，对基于遗传算法的图的着色问题的求解过程进行了深入的理论分析。

In EDSM, one does not introduce new flavor changing couplings, so the enhancement of the cross section of the top-charm associated production by gravity comes from s-channel virtual graviton exchange.

在带额外维标准模型中并没有引入新的味道改变顶点，因此引力对末态top-charm关联产生截面的增强来自于s道虚引力子的交换效应。

With i being the greatest lower bound on the number of latter points in the interior of any TLP with exactly v vertices, i(5)=i(6)=1,i(7)=i(8)=4 , it is proved that i increases without bound as ...

证明了随着TLP顶点数的增加，内格点数无限增加。并得出在允许旋转 180°条件下，有任意内格点数的三角形TLP，任意格点四边形都是TLP。

For example,the graph in Fig.3-5 is Hamiltonian（a possible path being P→Q→R→S→T→P）but is not quite Eulerian,since any path which includes every dege exactly once（e. g.P→Q→T→P→S→R→Q→S→T）must end up at a vertex different from the initial vertex.

例如，图3-5所示是一个哈密尔顿图（存在一条路P→Q→R→S→T→P）但不是一个欧拉图，这是因为图中任何包含所有边一次且仅一次的路（如P→Q→T→P→ S→R→Q→S→T）都不能回到原出发顶点。

A map is said to be Hamiltonian if all the vertices of the map are on one circuit.

一个地图称为哈密尔顿的若其上的所有顶点都在一个圈上。

Compared with the global harmonic mapping method, this approach has the following advantages.(1) The efficiency of the algorithm is greatly improved. The computational cost involved no longer increases exponentially with the number of vertices of the meshes to be fused.(2) The algorithm is robust as the ambiguity in graph structure combination is alleviated.(3) The detail of the cut mesh is fully kept.(4) The topology restriction of the original algorithm is eliminated.

与原有的基于全局调和映射的融合方法相比，新方法的算法效率大幅度提升，求解时间不再随融合模型顶点数的增加而呈指数增长；减少了二维网格拓扑合并中奇异情况出现的概率，提高了算法的稳定性；被剪切网格的细节得到完整保留；消除了原算法对融合区域拓扑的限制。

Made of 2000 pieces of rubber, metal mesh, nylon, fibreglass, and what not, it is technology and hauteur couture at their zenith.

取得2000年件，橡胶制品，金属丝网，尼龙，玻璃纤维，和什么不是，这是技术和欧特时装在其顶点。

Girded around with a wild boar's teeth, he shall climb over the mountain summits and higher than the shadow of the Helmeted Man.

束缚围绕着野猪的牙齿，他会攀登山峰的顶点，被带头盔的人的影子还要高。

She gently rebuff ed him, but agreed that they could be friends

她婉言拒绝了，但同意作为朋友相处。

If in the penal farm, you were sure to be criticized.

要是在劳改农场，你等着挨绳子吧！