内容提示: Scanline Polygon Fill Algorithm? Look at individual scan lines? Compute intersection points with polygon edges? Fill between alternate pairs of intersection points 文档格式:PDF | 页数:41 | 浏览次数:2 | 上传日期:2015-01-09 04:30:20 | 文档星级: ...
Although it implements a “hidden surface removal” algorithm that reduces the redundant pixel computations and writes for obscured triangles, it still generates and writes to a frame buffer (albeit a smaller, on-chip frame buffer) the many pixels necessary to fill in at least the visible ...
The algorithm presented here however equals the performance of an industry standard non-antialiased polygon filling algorithm, while providing good antialiasing quality. Furthermore, the algorithm addresses the requirements of a modern 2D rendering API by supporting features such as various fill rules. ...