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.

Posted Date: 4/26/2013 2:02:20 AM | Location : United States

Ask an Expert

Related Discussions:- Boundary-fill algorithm or flood-fill algorithm , Assignment Help, Ask Question on Boundary-fill algorithm or flood-fill algorithm , Get Answer, Expert's Help, Boundary-fill algorithm or flood-fill algorithm Discussions

Write discussion on Boundary-fill algorithm or flood-fill algorithm
Your posts are moderated

Write your message here..

Related Questions

Passive computer animations - types of computer animation, Passive Computer... Passive Computer Animations: That has no option for users to utilize computer graphics today is mostly interactive for example: movies. Frame animation is non-interactive anim

Region filling, what is region filling? give details what is region filling? give details

Whether cavalier projection is a parallel projection, State whether the fol... State whether the following statements are true or false. Give reasons/examples to justify your answer.  a)  Cavalier projection is a parallel projection. b)  Angles are not

Distinguish between convex and concave polygons, Distinguish between convex... Distinguish between convex and concave polygons? If the line joining any two points in the polygon lies totally inside the polygon then, they are called as convex polygons. If

Referential links, Referential Links: A third type of link is a referentia... Referential Links: A third type of link is a referential link. It is associated to the associative link. Quite than representing a relationship among two related ideas, a referent

Camera - polygon rendering and ray tracing methods, Camera - polygon render... Camera - polygon rendering and ray tracing methods Camera presents "viewpoint" or "eye" of observer. In order to explain the fundamental working of camera we can consider this

Assumption for diffuse reflection - polygon rendering, Assumption for Diffu... Assumption for Diffuse Reflection - Polygon Rendering  i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie

2d clipping, What is 2d clipping in computer graphics What is 2d clipping in computer graphics

What is the real value, QUESTION (a) People want to know design pattern... QUESTION (a) People want to know design patterns. i) What should their attitude be about design patterns? ii) How can people use design patterns to do a better job?

Computational algorithm for simulating physical system, computational algor... computational algorithm for simulating the behavior of different physical and mathematical systems Monte Carlo methods are an extensively utilized class of computational algor