Quan Gan
Abstract
传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充.文章提出通用扫描线多边形填充算法,该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题.通用扫描线多边形算法采用了坐标变换、浮点数舍入策略等重要方法.顶点扫描线号是该算法中的核心概念.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充.文章提出通用扫描线多边形填充算法,该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题.通用扫描线多边形算法采用了坐标变换、浮点数舍入策略等重要方法.顶点扫描线号是该算法中的核心概念.
Key concepts: Polygon (computer graphics), Algorithm, Computer science, Line (geometry), Rectilinear polygon, Scan line, Star-shaped polygon, Polygon covering