vertex

英 [ˈvɜːteks]

美 [ˈvɜːrteks]

n.  (三角形或锥形的)角顶; 顶点; 至高点

复数：vertices　

GRETEM8计算机

BNC.30455 / COCA.30568

牛津词典

noun

• （三角形或锥形的）角顶；顶点
  a point where two lines meet to form an angle, especially the point of a triangle or cone opposite the base
• 至高点；顶点
  the highest point or top of sth

英英释义

noun

• the point of intersection of lines or the point opposite the base of a figure
• the highest point (of something)
  1. at the peak of the pyramid
  Synonym:peakapexacme

双语例句

• Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.
  如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。
• An angle formed by three or more planes intersecting at a common point ( the vertex).
  三个或三个以上的平面相交于一个共同的点（顶点）而形成的角。
• Smooth-Smooths out a mesh by moving each vertex towards the barycenter of the linked vertices.
  光滑-通过向连接顶点的重心移动每个顶点来光滑一个网格物体。
• Create a new Vertex Group, and set Weight to 0. Select all vertices, and press Assign.
  创建一个新的顶点组，和设置权重到0.选择所有的顶点，点击分配。
• The space enclosed by three or more planes that intersect in a vertex.
  相交于一点的三个或更多的平面围绕而成的空间。
• This includes the ability to define and use vertex and fragment shaders using the GLSL language.
  这包括定义和使用顶点和碎片着色器使用GLSL语言的能力。
• Let us label each vertex with a 4 or 3 accordingly.
  我们给每一个顶点相应地标上4或3。
• Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
  进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
• Pick the edge with the lowest weight, and add this edge and its destination vertex to the tree.
  找出权值最小的边，把它和它所到达的顶点放入树的集合中。
• This paper mainly studies a complex network vertex weight calculation method.
  文章主要研究了复杂网络中点权的计算方法。