英语释义

1. the top of the head

2. the point opposite to and farthest from the base in a figure

3. a point (as of an angle, polygon, polyhedron, graph, or network) that terminates a line or curve or comprises the intersection of two or more lines or curves

4. a point where an axis of an ellipse, parabola, or hyperbola intersects the curve itself

5. a principal or highest point summit
the vertex of the hill

6. a point where two lines meet to form an angle especially the point on a triangle that is opposite to the base

7. the point opposite to and farthest from the base of a geometrical figure

8. the common endpoint of the sides of an angle

9. the highest point of the skull

片语

correlate vertices相关点

vertices buffer顶点缓沖

joined vertices连接顶点

Merge Vertices合并顶点

similar vertices相似点

Edit Vertices编辑顶点

Set Vertices设置约束点

Singular vertices非流形点

boundary vertices边界顶点

英汉例句

• 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.

  这里描述的KML仅为美国就使用了数以千计的多边形顶点，因此如果要在全球呈现或超越国家级的精确度，则可能需要速度更快的处理器。

• The constructor of VertexArray takes the number of vertices (eight), the number of components per vertex (x, y, z), and the size of each component (one byte).

  VertexArray构造函数中保存了顶点数量(8个)、各顶点的组件数(x,y,z)以及各组件的大小(1字节)。

• VERTEX_POSITIONS defines eight vertices in the same order, as shown in Figure 1a.

  VERTEX _ POSITIONS以同样的顺序定义了与图1a相同的8个顶点。

• One simple example is creating a graph where vertices are represented by a website「s pages and edges exist between pages containing links to other pages.

  一个简单的例子是创建这样一个图，顶点表示网站中的网页，而边表示页面指向另一个页面的链接。

• To reduce memory, you first separate the vertices from their triangle definitions.

  为节约内存，首先应将顶点与其三角形定义分隔开来。

• I」ve used eight vertices (the cube「s corner points) and placed the cube」s center at the coordinate system「s origin.

  我在这里使用了8个顶点(立方体的顶点)并使立方体的中心与坐标系的原点相重合。

• To work with a JSON encoding of a graph one needs to use the following schemas for vertices and edges.

  要理解JSON编码的图片，你就需要使用以下模式(schema)来描述顶点和边。

• For example, (0, 1, 2) defines the first triangle」s vertices counter-clockwise; the second triangle (1, 2, 3) is defined clockwise.

  例如，(0,1,2)按逆时针方向定义第1个三角形的顶点，而第二个三角形为(1,2,3)是按照顺时针方向定义的。

• These vertices for the triangle indicators are created in our modified version of GD: : Pie.

  三角形指示符的这些顶点都是在GD：Pie的修订版本中创建的。

• One possibility is to use one vertex color for the whole triangle; another is to interpolate the colors between two vertices and create a color ramp.

  可能性之一就是为整个三角形使用同样的顶点颜色。另外还有可能在两个顶点之间插入颜色，实现颜色梯度效果。

• The three vertices of the iron triangle collapse into one vertex of the Agile triangle called constraints.

  传统铁三角的三个顶点转变为「敏捷三角形」的一个顶点，被称为约束。

• Several triangles share the vertices at index 2 and 3, which means that they also share the color because one vertex can have exactly one color.

  有些三角形共享索引2和索引3 处的顶点，由于一个顶点只能有一种颜色，所以这也就意味着这些三角形也使用了一种相同的颜色。

• Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.

  最佳解通常都是其可行域所构成的多面体的一个顶点。

• Adding two vertices to a graph and connecting them through an edge named 「related_to」 is done as following.

  向一个图片添加两个顶点并将它们通过边连接起来的动作称之为「related _ to」，它是这么实现的。

• After reading in the Step 1 pie chart, polygons specified by the triangle vertices file are drawn on the Step 1 chart.

  在读入步骤1的饼图后，将在步骤1的图表中绘制由三角形顶点文件指定的多边形。

• A circle that is drawn around the outside of a triangle and contains all the vertices of the triangle.

  在三角形外部画的一个圆，包含了三角形的三个顶点。