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

Single point perspective transformation, Single Point Perspective Transform...

Single Point Perspective Transformation - Viewing Transformations In order to derive the particular point perspective transformations beside the x and y-axes, we construct fi

3dstudio - softwares for computer animation, 3Dstudio - Softwares for compu...

3Dstudio - Softwares for computer animation 3DStudio is a 3-D computer graphics programmed. 3DStudio runs on personal computers. This is relatively simple to use. Several schoo

Determine about the liquid crystal display, Determine about the Liquid Crys...

Determine about the Liquid Crystal Display LCDs are organic molecules, naturally in crystalline state, and they get liquified when excited by heat or E field. Crystalline state

Difference, difference between vecgen algoritham and bresenham''s algori

difference between vecgen algoritham and bresenham''s algori

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Differentiate between a raster image and vector image, Question: (a) D...

Question: (a) Describe in details the meaning of the following terms often available in drawing tools: (i) Welding objects; (ii) Trimming objects; (iii) Intersecting obje

Electronic encyclopedia, Electronic Encyclopedia : This is the applica...

Electronic Encyclopedia : This is the application of multimedia for the creation of an encyclopedia along with millions of entries and hypertext cross references covering a br

Curved surfaces, Build a program that allows: 1. using mouse or keyboard...

Build a program that allows: 1. using mouse or keyboard to move around on a set of 16 control points;  2. modify the value (drag along x, y, or z) of a point;  3. display

How is sampling done, Image Processing 1. How is sampling done? Explain...

Image Processing 1. How is sampling done? Explain quantization in digital image processing? 2. Explain in brief: (1) Image Subtraction (ii) Image averaging. 3. Explain in

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