Boundary-fill algorithm or flood-fill algorithm , Computer Graphics

Assignment Help:

boundary-fill algorithm or flood-fill algorithm

As you saw the implementation of scan line polygon fill requires that boundaries should be straight line segments.  The seed fill algorithms do not require any such constraints.  You only need to know an interior point of the closed boundary object to fill it.  This interior point is called a seed point.

However, determination of interior point for complex polygons such as the one shown in figure itself is a challenging task.The following methods are used to determine an interior point of the area to be filled. 

1.  Odd-even rule,

2.  Nonzero winding number rule.

Once an interior point of the object is determined, the boundary-fill algorithm or, flood-fill algorithm may be applied to fill the given area.


Related Discussions:- Boundary-fill algorithm or flood-fill algorithm

Xy-shear about the origin - 2-d and 3-d transformations, xy-Shear about the...

xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a

Give three ways to display a panel, QUESTION (a) Give some ways you can...

QUESTION (a) Give some ways you can change the magnification of a document? (b) Give three ways to display a panel? (c) Identify the differences between Selection tool an

Ray tracing algorithm, Ray Tracing:  Ray t racing is the technique to dete...

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the

Horizontal retrace - display devices, Horizontal retrace - Display Devices ...

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

Potentially entering and leaving points - clipping, Potentially entering an...

Potentially entering and leaving points - P E and P L The intersection point of the line and window might be classified either like potentially leaving or entering. Before g

Different types of parallel and perspective projection, Q.   Describe diffe...

Q.   Describe different types of parallel and perspective projection used in computer graphics.

Vecgen, explain vecgen algoritham

explain vecgen algoritham

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd