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

Illustration of bezier curves - modeling and rendering, To prove ‾P (1) = p...

To prove ‾P (1) = p n Solution : since in the above case we determine each term excluding B n,n (u) will have numerous of (1 - u) i (i = 0 to n) consequently by using u = 1

Ambient reflection-polygon rendering & ray tracing methods , Ambient Reflec...

Ambient Reflection-Polygon Rendering & Ray Tracing Methods When we go for the examiner of light effects, so surroundings play a significant role and it is assumed as there

Briefly describe the variants of the interaction model, Question: a) Th...

Question: a) The implications of transparency are a major influence on the design of system software. There are eight forms of transparency. Name and give a small description o

Principle vanishing point - perspective projections, Principle Vanishing po...

Principle Vanishing point - Perspective Projections Assume that line 1 and l2 be two straight lines parallel to each other that are also parallel to x-axis. If the projection

Compare bresenham line generation algorithm with dda, 1. Compare Bresenham...

1. Compare Bresenham line generation with Digital Differential Analyzer line generation. Ans.   Bresenham line generation algorithm is better than Digital Differential Analyze

Scenes - polygon rendering and ray tracing methods, Scenes - polygon render...

Scenes - polygon rendering and ray tracing methods In the context of ray tracing, a scene is a set of objects and light sources which will be viewed through a camera. All of

Objectives-introduction to computer graphics, Objectives After complet...

Objectives After completing this section, you must be familiar with: explain computer graphics, its characteristics and features; Conversations about applicat

Animation and games - cad and cam, Animation and Games - CAD and CAM I...

Animation and Games - CAD and CAM In our childhood, we all have seen that the flip books of cricketers that came free with some soft drink and where some pictures of similar p

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

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