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 is polygon mesh, What is Polygon mesh?  Polygon mesh is a method t...

What is Polygon mesh?  Polygon mesh is a method to show the polygon, when the object surfaces are tiled, it is more convenient to state the surface facets with a mesh function.

Detecting skin in colour images, In this lab you will learn how to use chro...

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in im

Two point and three point perspective transformations, Two-Point and Three-...

Two-Point and Three-Point Perspective transformations The two-point perspective projection can be acquired by rotating about one of the principal axis only and projecting upon

Is cad only helpful for design drawings, Question: Is CAD only helpful for ...

Question: Is CAD only helpful for design drawings? No. When true-scale, structurally valid drawings are the purpose for CAD's existence; it utilizes is as diverse as imagination

Merits -phong shading or normal vector interpolation shading, Merits -Phong...

Merits -Phong shading or Normal Vector Interpolation Shading Hence by finding intensities at various points across the edge we determine the intensity that is varying across t

Derive the single combined transformation matrix, A 2D geometric shape is r...

A 2D geometric shape is rotated about a point with coordinates (1,2)  by 90°  in a clockwise direction.  Then, the shape is scaled about the same point in the x-coordinate by 2 tim

Parameterized systems - computer animation, Parameterized Systems - Compute...

Parameterized Systems - Computer Animation Parameterized Systems is the systems which permit objects motion features to be given as part of the object descriptions. The adjus

Implement cohen sutherland and liang barsky algorithm, Implement Cohen Suth...

Implement Cohen Sutherland and Liang Barsky line clipping algorithms in C-language.  Test your code for line segments with end points falling in various regions.

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