The circle, which is effectively a Reuleaux polygon with an infinite number of sides, has the largest.

圆是一个有效的鲁洛正多边形有无数条边，有最大的面积。

Mathematicians estimated it by inscribing polygons in circles.

数学家通过在圆内接多边形来估算这个数值。

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.

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

That’s because this algorithm doesn’t need to sort any polygons, which makes it faster.

这是算法不需要对任何多边形进行排序，此速度更快。

This works with larger polygons too.

这也适用于更大的多边形。

Also they taught students how to draw polygon.

并且教学生画多边形。

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

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

Then Z-buffering starts with the first polygon in its list.

然后 Z 缓冲从其列表中的第一个多边形开始。

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

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

They may be triangles or polygons, or different kinds of shapes that you don't normally expect in a building.

它们可能是三角形或多边形，或者您通常不会在建筑物中看到的各种形状。

With scanline rendering coloring in all the polygons, our teapot looks like this.

在所有多边形中都使用扫描线渲染着色，我们的茶壶看起来像这样。

As an example, we’ll pick 3 polygons from different parts of our teapot.

例如，我们将从茶壶的不同部分挑选 3 个多边形。

Polygons are constantly being shuffled around in memory and changing their access order.

多边形在内存中不断地被洗牌并改变它们的访问顺序。

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

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

Because polygons are triangles, if you intersect one line, you have to intersect with another.

多边形是三角形，如果你与一条线相交，你必须与另一条线相交。

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

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

For a simple example, let’s consider just one polygon.

举一个简单的例子，让我们只考虑一个多边形。

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.

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