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

Resolution-introduction to computer graphics, Resolution Graphic demons...

Resolution Graphic demonstrations are utilized in presentations to assist convey a concept or express a mood, two kinds of demonstrations graphics are: Vector, and B

Numerically-controlled machines - cad and cam, Numerically-Controlled Machi...

Numerically-Controlled Machines: Prior to the development of Computer-aided design, the manufacturing world adopted elements controlled through numbers and letters to fi

Curves and surfaces - modeling and rendering, Curves and Surfaces - Model...

Curves and Surfaces - Modeling   and Rendering We have studied the method of drawing curves in diverse coordinate systems. Also we got the concept that it is the revolution of

Three dimensional display methods - 2d clipping algorithms, Three dimension...

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces.  A polygonal surface is described by vertices

Windowing transformations - raster graphics and clipping, Windowing Transf...

Windowing Transformations - Raster Graphics and  Clipping From the above section of introduction, we understood the meaning of the viewport and term window that could again be

Cohen sutherland algorithm - 2d clipping algorithms, Cohen Sutherland algor...

Cohen Sutherland algorithm Point clipping is very simple.  All you need to check is whether a point is inside the window extremes in x- and y-directions.  For line clipping sev

Multimedia and its features, Multimedia as the name suggests MULTI and MEDI...

Multimedia as the name suggests MULTI and MEDIA utilizes some media for example: text, graphics, audio, video and also animation, to convey information. Multimedia also consider to

Picture information - raster graphics and clipping, Picture Information - ...

Picture Information - Raster Graphics and  Clipping Now, the picture information is accumulated in the form of bit plans on which all bit plane complete information of pictur

You, are you a robot

are you a robot

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