in scan line polygon fill, each can line crossing a polygon, the area fill algorithm locates the intersection point of the scan line with the polygon edges. These intersection points are then stored from left to right and the corresponding frame buffer positions between each intersection painr are set to the specified fill color.
In boundary fill, approach to area filling is to start at a point inside a region and paint the interior outward toward and the boundary.
Chat with our AI personalities
A polygon (or any other plane shape) is convex if you take any two points inside it (or on its boundary) then the line joining those points is wholly inside (or on the boundary of) the polygon.
Finding the perimeter of a polygon is finding how far it is in total along all the edges of the polygon; whereas finding the area of a polygon is finding how much space the polygon covers. The perimeter of a polygon forms the boundary around the area of the polygon.
A polygon is a closed plane (flat) shape where an area is enclosed by a number of straight lines that meet, two at a time. These straight lines form the boundary of the polygon and are called its sides.
You can find a description of the algorithm in the Wikipedia article titled "Liu Hui's π algorithm".
Polygons are named after the number of sides which range upwards from 3 - without limit. They may be regular (if all their sides are congruent AND all their angles are as well) or irregular. They may be convex (a line joining any two points on the boundary of the polygon is wholly inside the boundary) or concave.