Consider this example scene with three overlapping polygons.

考虑这个具有三个重叠多边的示例场景。

The rate at which a computer fills in polygons is called the fillrate.

计算机填充多边的速率称为填充率。

In short, Z-buffering keeps track of the closest distance to a polygon for every pixel in the scene.

简而言之，Z 缓冲会跟踪场景中每个像素到多边的最近距离。

Look at this beautiful teapot made out of polygons.

看看这个由多边制的漂亮茶壶。

And over the years, more polygon lines were added, making the players look more and more lifelike.

并且经年累月，增加了更多的多边线条，们看起来越来越逼真。

The tangram is a dissection puzzle consisting of seven flat polygons which are put together to form shapes.

七巧是一个小块拼图游戏，由七个扁平的多边，这些多边放在一起可以其他状。

This works with larger polygons too.

这也适用于更大的多边。

To make things easier to follow, we’re going to color the polygons differently.

为了事情更容易理解，我们要给多边涂上不同的颜色。

Importantly, it also works for some polygons with fewer sides, including heptagons, hexagons, and pentagons.

重要的是， 它也适用于一些边数较少的多边，包括七边、六边和五边。

A collection of polygons like this is a mesh.

像这样的多边集合就是网格。

We start with Polygon A, the farthest one away.

我们从距离最远的多边 A 开始。

He spent 25 years on the effort computing to high accuracy the perimeter of a polygon with two to the 62 sides.

他花了 25 年的时间努力计算出一个多边的周长，该多边的周长为 62 条边。

The polygons that are closer, are in front!

更近的多边在前面！

She talks about pale cement paths that slice green lawns into polygonal fragments and walls of brown brick pockmarked by centuries of history.

她谈到了将绿色草坪切多边碎片的浅色水泥小路，以及布满数百年历史痕迹的棕色砖墙。

For our Polygon A, with a distance of 20, it wins against infinity every time.

对于我们的多边 A，距离为 20，它每次都战胜无穷大。

The scanline algorithm starts by reading the three points that make up the polygon, and finding the lowest and highest Y values.

扫描线算法首先读取构多边的三个点，然后找到最低和最高 Y 值。

Now, because we didn’t sort the polygons, it’s not always the case that later polygons overwrite high values.

现在，因为我们没有对多边进行排序，所以后面的多边不会总是覆盖高值。

In the case of Polygon C, only some of the values in the Z-buffer get new minimum distances.

在多边 C 的情况下，只有 Z 缓冲区中的一些值获得新的最小距离。

In each row, it calculates where a line – running through the center of a row – intersects with the side of the polygon.

在每一行中，它计算一条线（穿过行的中心）与多边的边相交的位置。

When it’s done with Polygon A, it moves on to the next polygon in its list, and the same thing happens.

完多边 A 后，它会移动到其列表中的下一个多边，同样的事情也会发生。