A plane graph together with the set of faces it determines is called a plane map.
一个平面图与它所确定的面的集的总体称为一个平面地图。
We'll be slicing things by a plane that is now in the direction of this vector,u and we'll be looking at the slope of the slice of the graph.
用沿着向量方向的平面,切开图像,然后看图像的剖面图，找出斜率。
Remember, partial f, partial x was obtained by y That means I am slicing the graph of f by a plane that is parallel to the x, z plane.
要记得，在这里的fx中,是作为常量保持不变的。，looking，at，the，situation，where，y，is，held，constant。,这是我用一个平行于xz坐标系的平面,横截了f，所得到的图形。
And, in terms of a graph, they correspond to slicing by a plane that's parallel to one of the coordinate planes, so that we either keep x constant, or keep y constant.
从图像上看，它们对应于,用平行于坐标轴的平面横截图像得到的，过程中保持x或y恒定。
See the point in the middle, at the origin, is a saddle point. If you look at the tangent plane to this graph, you will see that it is actually horizontal at the origin.
我们来看中间的那个点，在原点上，那就是一个鞍点，在这点做一个切平面,你可以看到这个切平面,是在原点上水平的。
Say you have a minimum, well, the tangent plane at this point, at the bottom of the graph is going to be horizontal.
如果你说这是个极小值，那么这点的切平面应该是水平的。
So, that gives me a slice of my graph by a vertical plane, and the slice has a certain slope.
那样给出图像的一个垂直切面，这个切面上有某个斜率。
OK, and for a given value of x, what we will do is we'll slice our graph by this plane parallel to the yz plane.
对于给定的x，我们要做的就是，用平行于yz平面的平面去切图像。
A progressive representation model for street networks of vector data was presented based on the theory of plane Euclidean graph and abstract complex cell.
基于平面欧几里得图和抽象胞腔复形理论，提出了街道网矢量数据的渐进式表达模型。
Thus, we give a make-graph method of conic section on plane with arbitrary point as foci, arbitrary line as directrices and arbitrary positive number as eccentricity.
从而给出了以平面上任意点为焦点、任意直线为准线，任意正数为离心率的圆锥曲线的直接作图方法。
There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.
七号信令网拓扑优化中存在高级信令转接点（HSTP）的A/B平面划分问题，其可归纳为一类新的图的划分问题。
The two-dimensional bandwidth problem is to find an embedding of graph G in a grid graph in the plane so that the longest edges are as short as possible.
二维带宽问题是将图G的顶点嵌入平面格子图，使其最长的连线尽可能短。
The two dimensional bandwidth problem is to determine an embedding of graph G in a grid graph in the plane such that the longest edges are as short as possible.
二维带宽问题是：确定图G在平面格子上的一个嵌入，使得最长边尽可能短。
The identifying and classifying method of the features of dimension elements in a 2-d plane graph is suggested.
本文提出二维平面图形的尺寸单元特征识别分类的方法。
The crossing number of a graph is the minimum number of pairwise intersections of edges in a drawing of in the plane.
图的交叉数只在好画法中得到，好画法是指满足边自身不交叉，相关联的边不交叉，任意两条交叉的边至多交叉一次的画法。
The crossing number of a graph is the minimum number of pairwise intersections of edges in a drawing of in the plane.
图的交叉数只在好画法中得到，好画法是指满足边自身不交叉，相关联的边不交叉，任意两条交叉的边至多交叉一次的画法。
应用推荐