Jing Zou
Abstract
Polygon filling is a complicated question in computer graphics. Introduced the scan line algorithm for polygon filling and realized it using VC++. The program can process any polygon including self-intersectant ones.
A significance statement is not available in the OpenAlex record.
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.
Polygon filling is a complicated question in computer graphics. Introduced the scan line algorithm for polygon filling and realized it using VC++. The program can process any polygon including self-intersectant ones.
Key concepts: Polygon (computer graphics), Computer science, Rectilinear polygon, Algorithm, Point in polygon, Realization (probability), Scan line, Process (computing)