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

Axis of rotation - construction of a solid, Axis of Rotation - Construction...

Axis of Rotation - Construction of a solid with a translational sweep Figure:  (a)                                                                          Figure  (b)

Briefly describe jackson''s theorem, Question 1 What is Packet-switching n...

Question 1 What is Packet-switching network? Discuss its basic operation Question 2 Briefly describe Jackson's theorem Question 3 List and explain the two popular

Orientation dependence - modeling and rendering, Orientation Dependence - M...

Orientation Dependence - Modeling and Rendering The outcomes of interpolated-shading models are dependent of the projected polygon's orientation. Because values are interpolat

Image space -approaches for visible surface determination, Image Space Appr...

Image Space Approach -Approaches for visible surface determination The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in

Cases for digital differential analyzer algorithm, Cases for Digital Differ...

Cases for Digital Differential Analyzer Algorithm 1)  If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Card or page based tools, Card or Page Based Tools : In these authoring sy...

Card or Page Based Tools : In these authoring systems, components are organized as pages of a book or a stack of cards. Thousands of pages or cards may be obtainable in the stack

Traditional animation techniques , Traditional Animation techniques as: ...

Traditional Animation techniques as: 1) Key Frames                        2) Cel Animation Formula: Required Key frames for a film = {[Time(in seconds)]

Parameterized systems - computer animation, Parameterized Systems - Compute...

Parameterized Systems - Computer Animation Parameterized Systems is the systems which permit objects motion features to be given as part of the object descriptions. The adjus

List out the various text clipping, List out the various Text clipping?  ...

List out the various Text clipping?  All-or-none string clipping -if all of the string is inside a clip window, keep it or else discards. All-or-none character clipping - disca

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