Scribd
Upload
20 views

Computer Graphics U2

The document discusses four algorithms for filling polygons and regions in images: 1. The scan-line polygon fill algorithm fills pixels between intersection points of scan lines with polygon edges from left to right. 2. Inside-outside tests identify whether points are interior or exterior to polygons. 3. The boundary-fill algorithm starts at an interior point and paints outward recursively to the boundary. 4. The flood-fill algorithm is similar but fills regions not defined by a single boundary color.

Uploaded by

MuzaFar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Computer Graphics U2

The document discusses four algorithms for filling polygons and regions in images: 1. The scan-line polygon fill algorithm fills pixels between intersection points of scan lines with polygon edges from left to right. 2. Inside-outside tests identify whether points are interior or exterior to polygons. 3. The boundary-fill algorithm starts at an interior point and paints outward recursively to the boundary. 4. The flood-fill algorithm is similar but fills regions not defined by a single boundary color.

Uploaded by

MuzaFar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Smartworld.asia Specworld.

in

UNIT_-2

2.1 Scan-Line Polygon Fill Algorithm


- Basic idea: For each scan line crossing a polygon, this algorithm locates the intersection
points of the scan line with the polygon edges. These intersection points are shorted from
left to right. Then, we fill the pixels between each intersection pair.

- Some scan-line intersection at polygon vertices require special handling. A scan line
passing through a vertex as intersecting the polygon twice. In this case we may or may
not add 2 points to the list of intersections, instead of adding 1 points. This decision
depends on whether the 2 edges at both sides of the vertex are both above, both below, or
one is above and one is below the scan line. Only for the case if both are above or both
are below the scan line, then we will add 2 points.

2.2 Inside-Outside Tests:

- The above algorithm only works for standard polygon shapes. However, for the cases
which the edge of the polygon intersects, we need to identify whether a point is an interior
or exterior point. Students may find interesting descriptions of 2 methods to solve this
problem in many text books: odd-even rule and nonzero winding number rule.

Smartzworld.com 1 jntuworldupdates.org
Smartworld.asia Specworld.in

2.3 Boundary-Fill Algorithm


- This algorithm starts at a point inside a region and paint the interior outward towards the
boundary.
- This is a simple method but not efficient: 1. It is recursive method which may occupy a
large stack size in the main memory.

void BoundaryFill(int x, int y, COLOR fill, COLOR boundary)


{ COLOR current;
current=GetPixel(x,y);
if (current<>boundary) and (current<>fill) then {
SetPixel(x,y,fill);
BoundaryFill(x+1,y,fill,boundary);
BoundaryFill(x-1,y,fill,boundary);
BoundaryFill(x,y+1,fill,boundary);
BoundaryFill(x,y-1,fill,boundary);
}
}

- More efficient methods fill horizontal pixel spands across scan lines, instead of
proceeding to neighboring points.

Smartzworld.com 2 jntuworldupdates.org
Smartworld.asia Specworld.in

2.4 Flood-Fill Algorithm


- Flood-Fill is similar to Boundary-Fill. The difference is that Flood-Fill is to fill an area
which I not defined by a single boundary color.

void BoundaryFill(int x, int y, COLOR fill, COLOR old_color)


{ if (GetPixel(x,y)== old_color) {
SetPixel(x,y,fill);
BoundaryFill(x+1,y,fill,boundary);
BoundaryFill(x-1,y,fill,boundary);
BoundaryFill(x,y+1,fill,boundary);
BoundaryFill(x,y-1,fill,boundary);
}

Smartzworld.com 3 jntuworldupdates.org

You might also like