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

Produce a complete 3d cad model, 1. Identify the market segment for the pro...

1. Identify the market segment for the product and write a basic PDS 2. Produce three concept sketch ideas - (remember the assignment is a CAD one not a concept creative design

Remark for the bresenham line generation algorithm, Remark for the Bresenha...

Remark for the Bresenham Line Generation Algorithm Remark: The algorithm will be properly the same if we suppose | m | Algorithm | m | (a) Input two line endi

Vecgen algorithm, Working of vecgen algorithm with diagram

Working of vecgen algorithm with diagram

Ray tracing - polygon rendering and ray tracing methods, Ray Tracing - poly...

Ray Tracing - polygon rendering and ray tracing methods "Ray tracing" is a technique of following the light by the eye to the light source. While ray casting only relates its

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

What do you understand by complementary colors, Problem : a. (i) Giv...

Problem : a. (i) Give another name for adjacent color. (ii) Describe briefly what do you understand by an adjacent color? b. (i) Describe briefly what do you unders

De casteljau algorithm - 2d clipping algorithms, De Casteljau Algorithm ...

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.

Referential links, Referential Links: A third type of link is a referentia...

Referential Links: A third type of link is a referential link. It is associated to the associative link. Quite than representing a relationship among two related ideas, a referent

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