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

Utility purpose of display processor in the graphic system, Explain the uti...

Explain the utility and purpose of display processor in the graphic system.  The purpose of the display processor is to free the CPU from the graphics chores. A major task of the d

Lossless audio formats, Lossless Audio Formats: Lossless audio formats as ...

Lossless Audio Formats: Lossless audio formats as TTA and FLAC give a compression ratio of around 2:1, sometimes extra. During exchange, for their lower compression ratio, such co

Geographic information systems (gis)-image processing, Geographic Informati...

Geographic Information Systems (GIS): The most generally utilized software is: ArcMap . Characteristics: I.          Works inside a geographic context. II.         Great

Derive the common transformation of parallel projection, Derive the common ...

Derive the common transformation of parallel projection into the xy-plane in the direction of projection d=aI+bJ+cK. Solution: The common transformation of parallel projection

Put the system of a geometric data table for a 3d rectangle, Put the system...

Put the system of a geometric data table for a 3d rectangle. Solution : Vertex Table Edge Table Polygon Surface Table

Line clipping algorithm - cohen sutherland algorithm, Line Clipping Algorit...

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

What is 2d, Question 1 What is 2D? Explain method of converting 2D pattern...

Question 1 What is 2D? Explain method of converting 2D patterns into 3D images Question 2 Write about the following tools to create dart Create dart Multiply dar

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