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

Basic transformations - 2-d and 3-d transformations, Basic Transformations ...

Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

Determine the transformation matrix for the reflection, Determine the trans...

Determine the transformation matrix for the reflection about the line y = x. Solution: The transformation for mirror reflection regarding to the line y = x, comprises the subs

Computations with phong shading, Computations with Phong Shading Compu...

Computations with Phong Shading Computations involved along with Phong Shading:  i)   Find out average unit normal vector at each polygon vertex. ii)   Linearly interpol

Important points about the curve segment, Important Points about the Curve ...

Important Points about the Curve segment - properties of bezier curves Note : if P (u) → = Bezier curve of sequence n and Q (u) → Bezier curve of sequence m. After that Co

Line generation algorithms - graphic primitives, Line Generation Algorithms...

Line Generation Algorithms - Graphic Primitives In previous section we have discussed the case of frame buffer, here information regarding the image to be projected upon the

Difference of gaussians, Difference of Gaussians In this project we wi...

Difference of Gaussians In this project we will implement the difference of Gaussians (DoG) edge detector and learn its characteristics. Part A: Design and implement a proc

What do you understand by the term contone, Question : (a) What do you...

Question : (a) What do you understand by the term ‘contone'? (b) What are spot colours? (c) You have been asked to prepare an artwork (a magazine) to send to a printer.

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

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