So, remember, the lecture challenges the reading points in the same order as they originally appear.

所以，要记住，这段演讲挑战阅读材料观点的顺序和它们最初出现的顺序是一样的。

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

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