vertices的例句大全

"so you have lots of parallelism, over the vertices and over the pixels, " ragan-kelley says.

“所以，从点到像素，这其中就有很多并行可以做的工作”Ragan-Kelley说。

for a graph g, the tur á n number, denoted by ex ( n; g), is defined as the maximum number of edges in a graph on n vertices that does not contain the given graph g.

设G是一个图，G的Turán数记作ex（n；G），是指阶数为n的不含G作为子图的图的最大边数。

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

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

there were twenty rooms, each connecting to three others, arranged like the vertices of a dodecahedron (or the faces of an icosahedron).

其中有20个房间，每个房间与另外三个相连接，排列像一个dodecahedron的顶点（或者是一个icosahedron的面）。

untangles a polygon and organizes the vertices to form a perfect geometric shape.

解开多角形和组织端点形成完善的几何学形状。

maximal set of independent vertices

极大独立顶点集

if the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.

如果边都是顶点的有序对，则得到有向图和有向重图的概念。

for a graph g, f is a strong edge coloring if it is proper and any two vertices are incident with different sets of colors.

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

based on the algorithm for the apex of polygon in a single row, a go-between polygonal vertices algorithm is presented for an optimal layout in the form of double row layout, opposite single row layout and opposite double row layout.

在普通单排多边形顶点算法的基础上，针对对头单排、普通双排、对头双排3种排样方式的特点，提出一种多边形顶点射线算法。

an algorithm of "iterative neighboring vertices retrieve" is proposed to tackle the problem of retrieving neighboring vertices when computing continuous shape index.

在该方法中，针对在计算连续Shape Index特征时确定邻域点集的问题，提出了一种顶点近邻迭代查找算法。

all vertices are clipped by the front plane of the viewing frustum.

所有顶点都被视图截锥的前平面所剪辑。

all vertices are clipped by the top plane of the viewing frustum.

所有顶点都被视图截锥的顶平面所剪裁。

all vertices are clipped by the right plane of the viewing frustum .

所有顶点都被视图截锥的左平面所剪裁。

all vertices are clipped by the back plane of the viewing frustum .

所有顶点都被视图截锥的右平面所剪裁。

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

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

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

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

A circ is an undirected graph having only vertices of even nonzero degree.

一广义圈是一无向图，其顶点次数都是非零偶数。

NB: a diagonal is a straight line joining two vertices not on the same side.

注: 对角线是连接两个不在同一边上的顶点的直线.

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

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

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

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