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

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

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.

这也适用于更大多边形。

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

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

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

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

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

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

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 缓冲区中一些值获得新最小距离。

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

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

Look at this beautiful teapot made out of polygons.

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

A collection of polygons like this is a mesh.

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

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

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

Consider this example scene with three overlapping polygons.

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

And finally, there’s the upper-left polygon.

最后，还有左上角多边形。

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

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

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

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

This process repeats for all pixels in the polygon, and that’s how we get textures.

对多边形中所有像素重复此过程，这就是我获取纹理方式。

For example, the bottom-most polygon is tilted downwards, away from the light source, which means it’s going to be dark.

例如，最底部多边形向下倾斜，远离光源，这意味着它将变暗。

An interesting problem arises when two polygons have the same distance, like if Polygon A and B are both at a distance of 20.

当两个多边形具有相同距离时会出现一个有趣问题，例如多边形 A 和 B 距离均为 20。