vertex
美式发音: [ˈvɜrˌteks] 英式发音: [ˈvɜː(r)teks]n.顶点；（三角形或锥形的）顶点；角顶；至高点
网络释义：威泰克斯；头顶；宿命点
复数：vertexs 复数：vertices 复数：vertexes 同义词反义词n.base
n.apex,summit,height,pinnacle,apogee
网络释义
vertexn.1.（三角形或锥形的）顶点；角顶a point where two pnes meet to form an angle, especially the point of a triangle or cone opposite the base
2.至高点；顶点the highest point or top of sth
n.1.【几】顶(点);【解】颅顶,头顶;【天】天顶2.顶(点),绝顶
n.1.the point that is opposite the base of a triangle; the point where two pnes join at an angle2.the highest point of something
1.顶点 站立位 erect position 头顶 vertex 耻骨联合上缘 superior margin of pubic symphysis ...
4.宿命点 Pinch 夹紧变形曲线 Vertex （节点） View Apgn 将所选节点对齐视图坐标平 …
6.天顶 vertex 顶点 vertex 天顶 vertex 最高点 ...
例句释义:,顶点,角顶,至高点,威泰克斯,头顶,宿命点1.In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。
2.Must be large enough to contain at least one vertex, but it need not be a multiple of the vertex size.必须足够大，以包含至少一个顶点，但它不必是顶点大小的倍数。
3.A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices.图中经过三个以上顶点且经过每个顶点仅一次的一条封闭路径。
4.Like a vertex of a polypne, it expresses a point on the object, but it also expresses the shape of the curve at the point.和折线上的定点类似，它也表示对象上的点，不过这里表示的曲线上的点。
5.The algorithm works because if a vertex has no successors, it must be the last one in the topological ordering.算法能够执行是因为，如果一个顶点没有后继，那么它肯定是拓扑序列中的最后一个。
6.Definition of a sphere a vertex is not allowed to enter. This allows colpsion against the animated cloth.定义一个球体的一个顶点不允许进入。这允许反向碰撞动画布料。
7.The only requirement is that vertex buffers used for software vertex processing must be allocated in system memory.唯一的要求是用于软件顶点处理的顶点缓存必须在系统内存中分配。
8.The front vertex power is measured through the distance portion as the first step in obtaining an accurate add power. B.前面屈光度通距离部分被测量，当在获得准确的第一步增加力量。
9.Of course, in the vertex shader I just write a general equation so we don't have to deal with each special case individually pke this.当然，在顶点着色器中，我们可以使用一个通用的公式来计算和叠加光照，而不需要像上面提到的那样分别应付各种不同的情形。
10.An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf.一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点。