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

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

Achieve a perspective projection on the plane of unit cube, Achieve a persp...

Achieve a perspective projection on the z = 0 plane of the unit cube, demonstrated in Figure (l) from the cop at E (0, 0, 10) upon the z-axis. Figure: I 01:  currently c

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

Remote sensing packages-Image processing, Remote Sensing Packages: general...

Remote Sensing Packages: generally utilized software illustration is-" ERDAS" Characteristics: I.Best suitable for satellite imagery system. II. ERDAS uses geo-spatial in

Midpoint circle generation algorithm - 2d shape primitives, Midpoint Circle...

Midpoint Circle Generation Algorithm   Just as a line drawing algorithm approximates infinite number of points on a line segment by only a finite number of pixels, a circle dra

Problems at shared vertices - modeling and rendering, Problems at Shared Ve...

Problems at Shared Vertices - Modeling and Rendering Shading discontinuities can arise while two adjacent polygons fail to share a vertex which lies along their common edge.

Explain what you understand by corporate style guide, Question 1: (a) ...

Question 1: (a) Explain the term ‘logo' with the use of an example. (b) Explain in detail what three basic questions you need to ask yourself before creating a logo. (c) You

Area filling algorithms - output primitives, Area Filling Algorithms Be...

Area Filling Algorithms Before we go ahead with area filling algorithms, a word about pixel addressing and object geometry. You know that line segments are discretized into fin

Write a c program to create a window of specified size, Write a C program t...

Write a C program to create a window of specified size and position and draw the following objects with dimensions of your choice, to fit within the window.   (a) A point  (b) A

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