本文研究ID-因子临界图的度和条件，得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界，同时说明这些结果是最好可能的。
Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
这里描述的KML仅为美国就使用了数以千计的多边形顶点，因此如果要在全球呈现或超越国家级的精确度，则可能需要速度更快的处理器。
The KML described herein USES tens of thousands of polygon vertices for the United States alone, so faster processors may be required for global rendering or precision beyond the state level.
通过估算顶点偏心在传统定心仪上的测量误差，可以发现传统定心仪很难达到控制目的，而干涉测量方法却能得到较高的准确度。
Error budget estimation about conventional centering method shows that it cannot be used to control the vertex off-centering error, so interferometric method was suggested.
算法还结合临近边界点合并等原则，删除对表达场景几何特征重要度低的顶点。
To further improve the simplification, vicinity vertices on the border of the area are merged.
有向根树就是只有一个顶点的出度为0，其余顶点的出度均为1的有向树。
A directed rooted tree refers to a directed tree which has one vertex with out-degree 0 and all the other vertices with out-degree 1.
讨论的是上层不带约束的二层线性规划模型，给出了求其所有顶点的算法，此算法为进行二层线性规划的灵敏度分析打下了坚实的基础。
The model of bilevel linear programming which upper lever has without constraint is discussed in this paper, the algorithm which can find all vertexes of the programming is given.
通过检验网络的度分布的熵、幂指数和顶点的最小度之间的关系，获得了无尺度网络对于随机错误的最优设计。
By examining the relationship of the entropy of the degree distribution, scaling exponent and the minimal connectivity, we get the optimal design of scale-free network to random failures.
我们统计了该网络的顶点项目度分布、项目大小分布、项目度与该顶点的销售额之间的关系、以及销售额的累计分布。
The act-degree distribution, act size distribution, the relationship between act degree and the saleroom, and the cumulative distribution of the saleroom are all studied.
根据两多边形的形心—顶点连线长度及相邻连线之间的夹角给出匹配度函数，并以此来建立两多边形顶点之间的对应。
According to the lines of centroid and vertex, and angles between the two adjacent lines, a function is given and then a correspondence is established between the two polygons.
基于齐次重心坐标，定义了新的网格顶点几何变量——锐度因子。
Based on homogeneous barycentric coordinates, a new geometric variable, sharpness factor, is defined for measuring sharpness of independent vertexes.
出度为零的顶点称作收点。
到底多少个顶点是ok的，依赖于具体的GPU设备和顶点着色器的复杂度。
How many vertices are "ok" depends on the GPU and the complexity of vertex shaders.
经性能分析可知，本算法的时间复杂度和Dijkstra算法相当。空间复杂度与顶点数具有线性关系。
The performance analysis shows that the time complexity of this algorithm and the Dijkstra algorithm. Space complexity of a linear relationship with the top points.
经性能分析可知，本算法的时间复杂度和Dijkstra算法相当。空间复杂度与顶点数具有线性关系。
The performance analysis shows that the time complexity of this algorithm and the Dijkstra algorithm. Space complexity of a linear relationship with the top points.
应用推荐