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

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

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

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

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

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

Or is it almost like beyond, it's the polygon thing you mentioned from a square.

或者说几乎超越提到的从正方开始的多边概念。

I just like the jaggy, polygonal look of it.

我就喜欢那种带有锯齿、多边质感的外观。

Then we repeat the process for the next farthest polygon, in this case, C. And then we repeat this again, for Polygon B. Now we’re all done, and you can see the ordering is correct.

然后我们对下一个最远的多边进行同样的处理，这里是C。接着我们再对多边B进行同样的操作。现在我们全部完，可以看到排序是正确的。

So, imagine a robotic module in a polygon shape and using that simple polygon shape to reconstruct multiple different forms to create a new form of robot for different tasks.

因此，想象一个多边的机器人模块，并使用这个简单的多边来重建多种不同的式，从而为不同的任务创建一种新式的机器人。

Stephen looked at the black form of the adjacent house, where it cut a dark polygonal notch out of the sky, and felt that he hated the spot.

斯蒂芬看着隔壁房子的黑色轮廓，从天空中划出一个黑色的多边缺口，觉得讨厌这个地方。

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

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

This works with larger polygons too.

这也适用于更大的多边。

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

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

We then do the ray-triangle intersection calculation that we mentioned earlier with just these six triangles.

然后我们进行之前提到的六个多边的光线三角相交计算。

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

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

Instead of filling pixels in a polygon with the same color, we can adjust the color based on how much the polygon cuts through each pixel.

与在一个多边中用相同的颜色填充像素，我们可以根据多边穿过每个像素的程度来调整颜色。

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

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

But importantly, it’s the same type of calculations being performed over and over and over again for many millions of polygons – scanline filling, antialiasing, lighting, and texturing.

但重要的是，这些计算一遍又一遍地重复进行，针对数以百万计的多边——填充扫描线、抗锯齿、光照和纹理映射。

And this teapot can sit in an even bigger scene, comprised of millions of polygons.

而且这个茶壶可以放置在一个更大的场景中，由数以百万计的多边组。

Consider this example scene with three overlapping polygons.

考虑这个包含三个重叠多边的示例场景。

The most straightforward way to handle this is to use a sort algorithm, and arrange all the polygons in the scene from farthest to nearest, then render them in that order.

处理这个问题最直接的方法是使用排序算法，将场景中的多边从远到近排列，然后按此顺序进行渲染。

The direction they face is called the Surface Normal, and we can visualize that direction with a little 3D arrow that’s perpendicular to the polygon’s surface.

们面对的方向称为表面法线，我们可以用一个小的垂直于多边表面的3D箭头来可视化这个方向。