vertices的例句大全

A Formula for Computing the Homeomorphism Class Number of G.M. ■_ ( n+ 1 vertices)

计算图式流形■（n+1vertices）同胚类个数的一个公式（英文）

These results relate to the optimality of a schedule at some of the vertices of a hyperrectangle of r dimension consisting of the varying parameters.

这些结果与调度在一个由变化参数构成的超矩形的一些顶点上的最优性有关。

Especially, we compute the Hochschild cohomology of endomorphism algebras of complete exceptional sequence of the path algebra whose quiver has 3 vertices and has no orientation.

第四章中，我们主要研究具有三个点的且不带方向圈的有向箭图的路代数上的完备例外序列的自同态代数的Hochschild上同调群。

The edge maybe approximate a straight line, and may be curved. So fit the edge with a wide-hough transform. That will received four coarse straight and four vertices from the indentation.

针对边缘可能近似直线，可能弯曲的情况，利用宽步长hough变换，拟合边缘，得到硬度压痕图边缘的四条较粗直线和四个顶点。

At the same time, by subdividing an icosahedron and projecting all its vertices onto the unit sphere from the center, we can get a spherical triangle mesh with subdivision topology.

然后，将一个正多面体进行细分并将每一次细分所产生的新顶点投影到单位球面上，如此生成一个细分网格。

To insert new points by getting intersection point of circle defined by the triangulation's three vertices and constraint line.

二是在约束线上插入点时，应用取三角形外接圆与特征线交点的方法。

Smooth-Smooths out a mesh by moving each vertex towards the barycenter of the linked vertices.

光滑-通过向连接顶点的重心移动每个顶点来光滑一个网格物体。

Adjoin two new vertices X and Y to N.

在n中添加两个新顶点X和Y。

The resistance distance r_ij between vertices I and j of a connected ( molecular) graph G is computed as the effective resistance between nodes I and j in the corresponding electrical network is constructed from G by replacing each edge of G with an unit resistor.

连通（分子）图G的两个顶点i和j之间的电阻距离为通过用单位电阻来代替G中的每条边而相应构造出的电网络中结点i和j之间的有效电阻。

Intimacy, passion, and commitment are the warm, hot, and cold vertices of Stemberg's love triangle.

亲呢，激情和承诺是斯顿伯格爱三角中表示暖，热，冷的三个顶点。

by studying factorization of adjoint polynomials of the union consisting of these new graphs and some isolated vertices, we prove that structure theorem of the chromatically equivalent graphs of their complements.

我们通过研究这两类新图与一定数目的孤立点组成的并图的伴随多项式的因式分解，证明了上述并图的补图的色等价图的结构定理。

The direction of the normals is determined by the direction in which you draw the vertices.

方向的法线方向是由在其中绘制的顶点。

A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

一个构形是面图的一连串连通的顶点与这些顶点的度。

The maximum and minimum values of the independent indices of trees with given a number of pendent vertices

具有给定悬挂点数目的树的独立指数的最大小值

The number of Equilateral triangles with the same colour in a Regular polyhedron with the vertices coloured with two colours

正多面体顶点二染色时同色等边三角形个数的讨论

Determining Convexo-Concave Vertices of Polygon by Dynamic Distinct Partition

基于动态分区的多边形顶点凹凸性判别

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

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

In this paper, we show that the Euler's formula of convex polyhedron also holds in the following two cases: Case 1.Trees generating from some vertices of the polyhedron;

将欧拉的凸多面体公式，推广至由多面体的顶点生长出树的情形，证明了在此情形下，欧拉公式仍成立。

In the molecular orbital theory, the molecule of the conjugated hydrocarbons considered generally can be represented in carbon-atom skeleton graph, the character of this kind of graphs is that all vertices have degree no greater than three and have a perfect matching.

在分子轨道理论中，所考虑的共轭碳氢化合物的分子常用碳原子骨架图来表示，此类图的特征是所有顶点的度不超过3，并且具有完美匹配。

A polyhedron whose vertices all lie in one or the other of two parallel planes; the faces that lie in those planes are the bases of the prismatoid.

顶点都在一个平面或两个平行的平面上的多面体；位于那些平面上的面是旁面三角台的底部。