查询词典 vertices

In 3D as in geometry, each triangle comprises three tops, and our tessellator will use position and normal, perpendicularvector to the surface of our triangle, to interpolate and generate new tops between vertices\'s already existing.

在3D作为几何学，每一个三角形由三个冠军，而我们tessellator将使用状况及正常矢量垂直于地面的三角形，插值生成新tops顶点之间\'s业已存在。

A function f: V→{-1,1} defined on the vertices of a graph G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one.

函数f：V→{-1，1}称为图G的符号全控制函数，如果对每一个开邻域集上的点的函数值的和都大于等于1。

In order to further extract open contour segment, such as circular arc, from a closed contour, a technique that combines parameters identification and contour vertices extraction was put forward.

为了抽取开放的规则轮廓段，提出了特徵参数识别和特徵轮廓抽取交互进行、有机结合的技术。为了抽取开放的自由曲线段，提出了基于转角映射的特徵连接点辨识技术。

We discuss the following graph operations that preserve fully orientability: the union of two graphs whose intersection is an edge, addition of a path of length at least 2 and addition of an edge between two vertices of degree 2 with a unique common neighbor.

我们会讨论下列几种能保持可全定向性质的图运算：将两个交集为一个边的图取联集、加入一个长度至少为2的路径及将两个度数为2且仅有一个共用邻点的不相邻点相连。

The method defines two types of oriented 4-valent plane graph: G_e and G_o, whose vertices are covered by E-tangles and O-tangles, respectively.

这一方法定义了两种有向4-度平面图：G_e和G_o分别用E-tangles和O-tangles覆盖两种有向4-度平面图的顶点。

The vertex within control mesh of fitting subdivision surface was located by iterative modification and local adaptive subdivision. This method makes it feasible to avoid the solution of linear equation system. The size of control mesh, which is corresponding to the fitting Loop subdivision surface, is smaller. The surface is reconstructed according to the given precision. It can represent detail characteristics of original model, and is piecewise smooth (C^2 continuous everywhere except at extraordinary vertices where they are C^1 continuous).

系统通过对控制网格顶点的循环修正和局部自适应细分来求解最终拟合细分曲面控制网格，避免了求解线性方程组，提高了拟合曲面的质量，实现了在给定精度下用较少的控制网格反映物体细节特征的分片光滑（片内除奇异点C^1，外其余C^2连续）的Loop细分曲面重建。

To compute the convex hull of a planar point set, first to find the extreme points of the planar point set and get the sub collections of points candidate for vertices of the convex hull between them.

新算法达到目前平面点集凸包问题的渐进最好算法的时间复杂度O，其中，n为平面点集的点数，h为平面点集凸包的顶点数。

In general, the operation of insertion of removal of vertices of degree 2 does not affect the planarity of a graph

一般地，插入或移去2次顶点运算，并不影响一个图的平面性。

For example, hovering over a part of a scene could open a ToolTip-like menu that lets users select one or more overlapping objects (this menu wouldn't be necessary in the simple case of one unambiguous object). If individual facets, vertices, or edges can be selected, each should hint at its pliancy as the mouse rolls over it.

例如，当掠过画面的某一部分时，可以打开一个类似菜单的工具提示，让用户选择一个或多个重叠的对象（这种菜单对于只有单个清晰对象的简单情况来说是不需要的），所有可以单独选择的平面、顶点或边在鼠标经过时都应该有受范性提示。

Joining two vertices of a polyhedron not in the same face.

对顶的连接多面体任意两个不在同一面上的''。

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.

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