查询词典 vertices

Any modification to the surface was simply a matter of dragging the vertices and the tangency handles.

针对表面所作的任何修改只是简单的托拽顶点和切线手柄。

On the source data level, the vertices are assembled and tessellated.

在源数据层，顶点被组合及镶嵌。

However, these methods, that repeatedly merge nearby surface points or mesh vertices based on error minimization considerations, perform best for highly tessellated surfaces that are otherwise relatively smooth and topologically simple.

然而，这些基于误差最小考虑的重复的合并邻近表面的点或网格顶点方法，对于高度栅格化的平滑的拓扑简单的表面处理效果是最好的。

For traditional displacement mapping, the mesh is uniformly tessellated to a high number of polygons and then the vertices are displaced according to the height of the displacement map.

对于传统的 displacemnt 贴图， mesh 被不一致细化产生大量多边形并把顶点按照 displacement 纹理做移动。

Through studying two pairs of opposite vertices in tetragon, the author derived the curve equation of focus in form of complex number and its expression of right angle coordinate.

从研究四边形的两对对顶点出发，推导出复数形式的焦点曲线方程及其直角坐标表达

Themethod combines the deterministic optimization technique with the orthogonaloptimal experiment method to change the 2￣n vertices of the tolerance region into(n+1)constraint conditions,and uses nondifferent...

该方法应用确定性方法和正交最优化方法相结合，将容差域的2￣n个顶点离散为n＋1个约束条件，并利用不可微规划直接得到DCTT问题的最优解。

A proper k total colouring of a graph G is a colouring to its vertices and edges using k colours such that no two adjacent or incident elements of G may be assigned the same colour.

利用梯度投影与罚函数相结合的技巧，将带不等式和等式约束的优化问题化成一个无约束问题，提出了初始点可任意的求解不等式、等式约束优化问题的摄动梯度投影算法；参数δk取不同的数还可以得到一类梯度投影算法，从而得出了在搜索方向和步长不精确条件下的梯度投影法，保证了在实际应用中更容易实现；在较弱条件下，证明了该算法的全局收敛性。

In fact, on one hand, it is often found that two graphs with the same number of verticesand the same connectivity(edge-connectivity) may result in entirely different forms after a minimum disconnecting set of vertices is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct.On the other hand, we often face this question: how easily can we disrupt a system at the least cost, on the contrary, when we set up a system, especially a communication system, we try our best to make it as stable as possible that it can be reconstructed easily if it do get disrupted .

对于两个具有相同点数，具有相同点连通度的图，从图中分别去掉使图不连通的点集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。

An example of a Markov chain is a simple random walk where the state space is a set of vertices of a graph and the transition steps involve moving to any of the neighbors of the current vertex with equal probability (regardless of the history of the walk).

举一个马尔科夫链的简单例子-----随机移动。随机移动的状态空间是由一组结点够成的图，而状态的改变是因为从当前的结点以相等概率的方式移动到任意一个相邻结点。（而这种移动是与原先的随机移动没有关系的。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

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.

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