When two lines meet at a point, or vertex, an angle is formed.

当两条线相交一点，即顶点，就形成了一个。

Now I want you to focus on the vertices of  that triangle, these white dots.

现希望你把注意力集中那个三形的顶点上，这些白点。

V stands for vertices, E for edges, F for faces.

V 代表顶点，E 代表边，F 代表面。

Let's begin with the first step called vertex shading.

从第一步“顶点着色”开始。

Here’s a closer look at what happens when we make the folds at this vertex.

下面仔细看看这个顶点做折叠会发生什么。

These two stars, which form the vertices of the Summer Triangle along with Deneb, are clearly visible during summer from places in the mid-northern latitudes.

这两颗恒星和天津四一起构成了季大三，季从中纬度地区可以清晰地看到。

But the key is to treat this as a new graph  where those intersection points are them vertices.

但关键是将其视为一个新图，其中这些交点是顶点。

Here's a closer look at what happens when we make the falls at this vertex.

下面仔细看看这个顶点坠落会发生什么。

Rearranging a little, you  would take the number of edges minus the number of vertices plus two.

稍微重新排列一下，你可以用边的数量减去顶点的数量再加上二。

So, let's focus on a single vertex.

因此，关注一个顶点。

So the total number of vertices here  would not be N but N plus N choose four total intersection points.

因此，这里的顶点总数不是 N，而是 N 加 N 选择四个交点。

So to our question, can you make it so that every vertex has a red, green and blue neighbor?

那么对于的问题，你能每个顶点都有一个红色、绿色和蓝色的邻居吗？

Whose corners have vertices (1, 1, 1), (1, 1, -1), on and on and on.

其有顶点 (1, 1, 1), (1, 1, -1)，等等。

Though in that case, colors were given to pairs of vertices instead of individual ones.

但这种情况下，颜色被赋予给成对的顶点而不是单个的顶点。

If we add a mountain fold at this vertex, there are three valleys and two mountains.

如果这个顶点加上一个山折，就是三个山谷和两个山峰。

So we can see here it says, " Consider reducing the number of triangles and consider reducing the work in the vertex shader."

“考虑减少三形的数量，并考虑减少顶点着色点的工作。”

If I hover over the vertices row, here I can get an idea of, OK, what's the summary for that draw call for the vertices submitted to the scenes?

如果顶点行上面悬停，就能够了解那个顶点的绘制调用提交到场景的总数是多少？

To start, take a 2x2 box centered at the origin Its corners around the vertices (1, 1), (1, -1), (-1, 1) and (-1, -1).

首先，取一个以原点为中心的 2x2 盒子， 其围绕顶点 (1, 1)、(1, -1)、(-1, 1) 和 (-1, -1)。

After three vertices of the train are transformed  using similar matrix math, we get a single triangle moved onto the view screen.

使用类似的矩阵数学变换火车的三个顶点后，得到一个移动到视图屏幕上的三形。

When the sixpointed star was laid perfectly over the Great Seal of the United States, the star's top vertex fit perfectly over the Masonic all-seeing eye ...

当六星完美地铺设美国国徽上, 这颗星的顶点完美地贴合共济会全视之眼上。