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

What you mean by parallel projection, What you mean by parallel projection?...

What you mean by parallel projection?  Parallel projection is one in which z coordinates is discarded and parallel lines from every vertex on the object are extended unless the

Image precision, what is image precision in computer graphics

what is image precision in computer graphics

What are the advantages of the boundary representation, Advantages of the B...

Advantages of the Boundary Representation (i) This format gives efficient picture generation and easy access to other geometric information. (ii) The changes produced by mos

What are the utilizations of inverse transformation, What are the utilizati...

What are the utilizations of Inverse transformation? Provide the Inverse transformation for translation, shearing, reflection, scaling and rotation. Solution: We have observed

Line drawing algorithm, Adavantage and disadvantages of DDA and Bresenhams ...

Adavantage and disadvantages of DDA and Bresenhams line drawing algorithm

Polygon tables - curves and surfaces, Polygon Tables - curves and surfaces ...

Polygon Tables - curves and surfaces All polygons are analogous to a graph G (V, E). Remember that the analogy in which a polygon surface can be specified along with as a set

Structural links, Structural Links: The information contained inside the h...

Structural Links: The information contained inside the hypermedia application is classically organized in several suitable fashions. This organization is represented by using stru

Graphics tablet - cad and cam, Graphics Tablet - CAD and CAM We need ...

Graphics Tablet - CAD and CAM We need to know what we mean via tablet in computer terminology, before going into details on the graphic tablet, since in the other disciplines

Simple graphical user interface, The RIA should consist of: i) A simple ...

The RIA should consist of: i) A simple Graphical User Interface (GUI) constructed from a simple navigation system (comprising of around 5 key frames) making use of the Flash tim

Simulating accelerations - computer animation, Simulating Accelerations - C...

Simulating Accelerations - Computer Animation In previous block, we have seen the dominance and function of mathematics in computer graphics and now, we will undertake the invo

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