- 更多网络例句与相邻顶点相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Given an undirected graph,the vertex coloring problem is to assign a different color for vertex mutually adjacent.
图的顶点着色问题是指无向图中任意两个相邻顶点都分配到不同的颜色，这个问题是著名的NP 完全问题，没有非常有效的算法。
-
In particular, the microlenses are disposed such that each side of a disposition region where the microlenses are disposed has a concave curve with respect to a line connecting adjacent vertexes of the disposition region.
具体的，将微透镜布置为使得布置微透镜的布置区的每一个侧边都具有相对于连接布置区相邻顶点的直线的凹曲线。
-
N.1 The Country Point n is located inside one of the three Exterior Opposite Angle Area of the big triangle.
n.1 国家点n落在四点全相邻基本三角的外部三角形的外部对角映射区，封闭于四点全相邻基本三角中的国家点对国家点n而言可以忽略不计，国家点n将最多可以同该四点全相邻基本三角的外部三角形的三个顶点相邻，这时n.1的情况就等同于前述4.1的情况，此时4色依然足够
-
The normal and curvature are significant geometry information for 3D point clouds.
差分坐标以其相关之拉普拉斯运算子在三维数位几何模型上已有许多的研究及应用，顶点的差分坐标计算是由顶点与拓扑上之相邻点的相对位置关系所求得，因此顶点之差分坐标代表了区域曲面起伏变化情况，差分坐标其方向会近似於区域法线方向而其长度会近似予区域平均曲率，此两项资讯为点云资料重要几何资讯。
-
Vertices, in each m inute the ant travels from one vertex to an ad jacent vertex.
钟均会从一个顶点走到另一个相邻的顶点。
-
Letσ2 denote the minimum degree sum of a pair of nonadjacent vertices.
设σ2表示不相邻顶点度和的最小值。
-
Joining two nonadjacent vertices of a polygon.
对角线的：连接多边形任意两个不相邻顶点的直线的
-
Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.
研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。
-
Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.
研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。
-
The error evaluation method most frequently used in current applications is the quadric error metrics, originally proposed by Garland and Heckbert in [9], in which a quadric (represented by a symmetric, positive semi-definite matrix) is associated with each vertex, subsuming the sum of the squared distances of the vertex to all its incident planes.
当前采用的最广泛的误差评估方法是QEM方法。这个方法中，每一个顶点都与一个二次误差相关联，包含了顶点到其相邻面距离的平方和。
- 更多网络解释与相邻顶点相关的网络解释 [注：此内容来源于网络，仅供参考]
-
adjacent edge：相邻边
终端结点 terminal node | 相邻边 adjacent edge | 相邻顶点 adjacent vertex
-
adjacent small side：(相邻)直角边
adjacent side 邻边 | adjacent small side (相邻)直角边 | adjacent vertex 邻顶点
-
adjacent vertex：相邻顶点
相邻边 adjacent edge | 相邻顶点 adjacent vertex | 关联边 incident edge
-
adjacent vertex：邻顶点
adjacent small side (相邻)直角边 | adjacent vertex 邻顶点 | adjoining 毗邻的,邻接的
-
Adjacent：相邻的
保证一般都会以书面并以契约形式订立,称为Deed二元组称为图(graph).为结点(node)或顶点(vertex)集.为中结点之间的边的集合.点对称为边(edge)或称弧(arc),其中,称是相邻的(adjacent),称u,v与边相关
-
potential function：势函数
在这种情况下,条件随机场图可以看成是把Y中的所有元素Yv的联合概率分布因式分解成多个势函数(potential function)的归一化积,其中每一个势函数都会作用于相邻的顶点对Yi和Y(i+1).
-
Relax：<松弛>
"松弛"(Relax) 命令可通过移动小平面顶点的坐标来平滑曲面. 这是一个迭代过程. 迭代次数越多,曲面就越平滑,但迭代次数太多会显著改变原始扫描数据. .. (2008-04-02)关于合并和交截曲面 在"逆向工程"中,可以合并两个相邻或相交曲面.
-
Adjacent vertices：相邻顶点
Bisect 角平分线 | Adjacent vertices 相邻顶点 | Arc 弧