Trapezoidal no volume! It is a planar graph!
梯形没有体积！它是一个平面图形！
Most of the two-dimensional models that manage topology are based on the planar graph theory.
大多数操作拓扑结构的二维模型都是基于平面理论的。
Using this method can be based on signal spectral analysis method of fault diagnosis into a planar graph recognition.
利用该方法可以将基于信号频谱分析的故障诊断方法转化为平面图形的识别。
As for the ramp engineering, the author put forward the difference incremental algorithms for the planar graph gradients.
针对斜坡道工程，提出平面图形梯度差值生长构建算法；
By VRML, the users of the World Information Network can view spatial model, without being confined to planar graph, image.
通过VRML，全球信息网的使用者可以观赏到立体空间的模型，而不限于二维空间的图形、影像。
Secondly, we investigate the list coloring of planar graphs, and give a su? Cientcondition for a planar graph being 3-choosable.
其次，文章研究了平面图的列表着色问题，给出了平面图3 -可选的一个充分条件。
The (4,6)-regular maximum planar graph is studied, and its existence condition and construction method are obtained respectively.
本文讨论了（4，6）-正则极大平面图，得到了（4，6）-正则极大平面图的存在条件及构造方法。
In this paper, Euler's formula and Handshaking lemma is used to obtain the face chromatic number of a planar graph by solving equations.
本文在前人研究的面着色问题基础上，运用欧拉公式和握手定理通过解方程组得到连通平面图的面色数。
The cube formed after cutting one part off the same planar graph in different ways of motion and its method of calculation are introduced.
介绍了同一平面图形按不同方式运动截取一部分形成的立方体的图形及计算方法。
The cube formed after cutting one part off the same planar graph in different ways of motion and its method of calculation are introduced.
从由曲线普通方程求平面图形面积的公式出发推出在各种情形下由曲线参数方程求平面图形面积的公式。
This paper puts forward a kind of method about type synthesis of the one dof planar closed chains mechanisms, that is , "type synthesis by planar graph".
提出了一种关于自由度平面闭链机构的构型方法，即“平面图形构造方法”。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
Because of the existence of it, the information conveyed by planar graph design is more scientific and more accurate and expression methods are more colorful.
也正是由于它的存在，使平面图形设计的信息传达更加科学准确，表现手法更加丰富多彩。
Some upper bounds of the edge number for two class planar graphs are given. Some sufficient conditions for a planar graph to be class 1 are obtained through these bounds of edge number.
给出了平面图为第一类图的边数的一些上界，并给出了平面图为第一类图的一些充分条件。
With the linear graph and adjacent matrix method of graph theory, the possible forms of this mechanism are discussed by analyzing that of kinematic chain with 4~8 links connected by planar low pair.
运用图论的线图和邻接矩阵方法从分析平面低副4～8杆运动链的可能形式出发，分析了以连杆为起始构件这类机构的可能有的形式。
This paper introduced a bond graph method for the dynamical static force analysis of planar elastic linkage, and presented a bond graph model of this linkage.
本文介绍了平面弹性连杆机构动态静力分析的键合图法。给出了平面弹性连杆机构的键合图模型。
This paper presents an algorithm for solving a complete monotonic chain set in the planar straight line graph g.
本文提出求平面直线图完全单调链集的一种算法。
In essence, 3d ventilation network graph is a 'figurative' ventilation network graph, and it surpasses the technical level of the conventional planar network graph.
从本质上说，3d风网图表达的是“具象”的通风网络图，它超越了传统平面网络图的技术层面。
In essence, 3d ventilation network graph is a 'figurative' ventilation network graph, and it surpasses the technical level of the conventional planar network graph.
从本质上说，3d风网图表达的是“具象”的通风网络图，它超越了传统平面网络图的技术层面。
应用推荐