New Method of Filling Arbitrary Polygon
Rui Xu
Abstract
Rui Xu
Abstract
A method of filling arbitrary polygon which is based on scan line and seed filling is proposed. In this method, the outside area of polygon is fastly marked by the scan line points, and the remnants of outside area are marked by the seed points which come from the scan line and edge points on polygon, the areas inside the polygon with no mark are filled. Experimental result shows that the computational redundancy is reduced and the filling accuracy is improved even though different methods of marking outside area are used. The method can be used to fill arbitrary polygon.
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.
A method of filling arbitrary polygon which is based on scan line and seed filling is proposed. In this method, the outside area of polygon is fastly marked by the scan line points, and the remnants of outside area are marked by the seed points which come from the scan line and edge points on polygon, the areas inside the polygon with no mark are filled. Experimental result shows that the computational redundancy is reduced and the filling accuracy is improved even though different methods of marking outside area are used. The method can be used to fill arbitrary polygon.
Key concepts: Polygon (computer graphics), Rectilinear polygon, Polygon covering, Star-shaped polygon, Point in polygon, Visibility polygon, Simple polygon, Enhanced Data Rates for GSM Evolution