Polygon filling algorithm - raster graphics and clipping, Computer Graphics

Assignment Help:

Polygon Filling Algorithm - Raster Graphics and Clipping

In several graphics displays, this becomes essential to differentiate between different regions by filling them along with different colour or at least by different shades of gray. There are various methods of filling a closed area with a specified colour or corresponding gray scale. The most general classification demonstrated through following algorithms:

a)  Scan Line polygon fill algorithm.

b)  Seed fill algorithm./Flood fill algorithm that are additionally classified as:

(a) Boundary fill algorithm and

(b) Interior fill algorithm

We confine our discussion to scan line polygon fill algorithm, while we will discuss the others in briefly at the end of such section.


Related Discussions:- Polygon filling algorithm - raster graphics and clipping

Phong shading algorithm, Q. Describe briefly phong shading algorithm.   ...

Q. Describe briefly phong shading algorithm.   OR                Write short note on phong shading.    Phong shading   Phong shading or normal vector interpo

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

Consider shiny surface with diffused reflection coefficient, Consider a Shi...

Consider a Shiny Surface Along With Diffused Reflection coefficient Consider a shiny surface along with diffused reflection coefficient of 0.8 and ambient reflection coeffici

Curves and surfaces - modeling and rendering, Curves and Surfaces - Model...

Curves and Surfaces - Modeling   and Rendering We have studied the method of drawing curves in diverse coordinate systems. Also we got the concept that it is the revolution of

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

Basic tests - producing polygon surface, Basic Tests - Producing Polygon Su...

Basic Tests - Producing Polygon Surface A few basic tests that must be performed before producing a polygon surface through any graphic package as: 1) All vertexes are list

Images - systems research group, The image you have been given for contour ...

The image you have been given for contour extraction is shown in Figure 1. The method for constructing the search space is shown in Figure 2. It is generated from two initial discr

Find out projection matrix for oblique projection, Find Out Projection Matr...

Find Out Projection Matrix for Oblique Projection To find out projection matrix for oblique projection, we want to find out the direction vector d. Because vector PP' and vect

What is seed fill, What is seed fill?  One way to fill a polygon is to ...

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

Implement cohen sutherland and liang barsky algorithm, Implement Cohen Suth...

Implement Cohen Sutherland and Liang Barsky line clipping algorithms in C-language.  Test your code for line segments with end points falling in various regions.

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