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

Distinguish between uniform scaling and differential scaling, Distinguish b...

Distinguish between uniform scaling and differential scaling?  When the scaling factors sx and sy are assigned to the similar value, a uniform scaling is produced that maintain

Area-subdivision method, Area-Subdivision method This method is a ty...

Area-Subdivision method This method is a type of an image-space method although uses object-space operations re-ordering or sorting of surfaces as per to depth. Area sub-div

Calculate the entropy of the source, Question 1) Encode the following s...

Question 1) Encode the following string using HUFFMAN ENCODING:                            DO YOU LIKE TINKY WINKY OR EMPTY DUMPTY?     Empty spaces are considered.

Important points for bresenham line generation algorithm, Important points ...

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

Visible-surface detection, Visible-Surface Detection For the generation...

Visible-Surface Detection For the generation of realistic graphics display you know that hidden surfaces and hidden lines should be identified for removing. For this reason we

Limitations of cohen sutherland line clipping algorithm, Limitations of Coh...

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

Scale a sphere cantered on the point (1, Scale a sphere cantered on the poi...

Scale a sphere cantered on the point (1, 2, and 3) with radius 1, so that the new sphere has the same centre with radius 2.    Solution: Translate the sphere so that its centre

Graphics, GRAPHICS: It is one of the core elements of any multimedia ...

GRAPHICS: It is one of the core elements of any multimedia application. We all have heard a well-known saying as "one picture conveys a message of 1000 words", hence without

Transformation, Define transformation. Explain all basic transformation

Define transformation. Explain all basic transformation

Transformation for isometric projection - transformation, Transformation fo...

Transformation for Isometric projection - Transformation Suppose that P(x,y,z) be any point in a space.  Assume as a given point P(x,y,z) is projected to the P'(x'y',z') on t

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