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 a dot size, What is a dot size? Dot size may be explained as th...

What is a dot size? Dot size may be explained as the diameter of a single dot on the devices output. Dot size is also known as the Spot size.

Define octrees, Define Octrees?  Hierarchical tree structures called oc...

Define Octrees?  Hierarchical tree structures called octrees, are used to show solid objects in some graphics systems. Medical imaging and other applications that needs display

Define coherence properties, Define coherence properties?  A coherence ...

Define coherence properties?  A coherence property of a scene is a part of a scene by which relate single part of the scene with the other parts of the scene.

Reflection, determine the tranformation matrix for reflection,computer grap...

determine the tranformation matrix for reflection,computer graphics

What do you mean by emissive and non-emissive displays, What do you mean by...

What do you mean by emissive and non-emissive displays? EMISSIVE: The emissive display changes electrical energy into light energy. The plasma panels, thin film ele

Data set, In this project, the image data set consists of 320 training imag...

In this project, the image data set consists of 320 training images and 285 test images. Table 1 shows the image data set in details. In addition to the original images, th

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.

Characteristics of bitmap data, Characteristics of Bitmap Data: Bitmap dat...

Characteristics of Bitmap Data: Bitmap data can take up many rooms. A CMYK A-4 size picture which is optimized for medium quality printing (150 lpi) takes up 40 Mage Bytes. Compre

Important points for bresenham line generation algorithm, Important points ...

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

Objectives-visible-surface detection, After going through this section, you...

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

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