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

当两条线相交在一点，即顶点时，就一个角。

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

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

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

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

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

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

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

现在我希望你把注意力集中在那个角顶点上，这些白点。

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

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

So, let's focus on a single vertex.

因此，让我们关注一个顶点。

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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 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)。

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

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

So each step here we're looking at the three neighbors of a given vertex, counting up the red ones, and adding that to a total tally.

因此，这里每一步我们都会查看给定顶点个，计算红色顶点数量， 并将其添加到总计数中。