Boundary-fill algorithm or flood-fill algorithm , Computer Graphics

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.

Posted Date: 4/26/2013 2:02:20 AM | Location : United States







Related Discussions:- Boundary-fill algorithm or flood-fill algorithm , Assignment Help, Ask Question on Boundary-fill algorithm or flood-fill algorithm , Get Answer, Expert's Help, Boundary-fill algorithm or flood-fill algorithm Discussions

Write discussion on Boundary-fill algorithm or flood-fill algorithm
Your posts are moderated
Related Questions
Gourand shading OR Intensity interpolation scheme Now there polygon is rendered through linearly interpolating intensity values across the surface. Intensity values for all po

Animator Studio and Elastic Reality - Computer Animation Animator Studio It is a cell animation program from AutoDesk. Its predecessor was Animator Pro for PC DOS. Anima

Interpolation of surface - Polygon Rendering Interpolation of surface normals beside the polygonedge between two vertices is demonstrated above in the figure 15. Here the norm

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

Objectives of 2-D Viewing and Clipping After going through this section, you should be capable to: 1. Describe the concept of clipping, 2. Observe how line clipping is p

Write a C-code which generates a font interactively.This means after every n mouse clicks, a Bezier curve is generated and then the terminal point of the last drawn Bezier curve is

(a) Differentiate between the following compression algorithm: 1. Shannon -Fano Algorithm and 2. Huffman Encoding (b) A statistical encoding algorithm is being considered

Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (

Question 1 Explain the fundamental steps in digital image processing 2 Explain the terms reflection, complement and Translation with example diagrams 3 Explain about Imag

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the