Prepare an initial sorted edge list, Computer Graphics

Assignment Help:

Q: For the following polygon, prepare an initial sorted edge list and then make the active edge list for scan lines y = 5,20,30,35 Coordinates of the vertices are as shown in Figure.

733_prepare an initial sorted edge list.png

Answer: First label the vertices and edges as shown in the Figure

1859_prepare an initial sorted edge list 1.png

 

Start with y = 0 and continue till y = 40. For y = 0 there are four edges, namely E0, E1, E2 and E3.  The sorted edge table is created as follows:

2001_prepare an initial sorted edge list 2.png

Active edge lists (AEL) for scan lines y = 5, 20, 30, 35 are as follows.

Y = 5, AEL = { E0, E1, E2, E3}

Y = 20, AEL = { E6, E3}

Y = 30, AEL = { E6, E5, E4, E3}

Y = 35, AEL = { E6, E5, E4, E3}

 

 

 


Related Discussions:- Prepare an initial sorted edge list

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

Explain briefly ancillary operations, Problem: a. Explain briefly six A...

Problem: a. Explain briefly six Ancillary Operations? b. When do ancillary operations take place? c. (i) What is flexography? (ii) Provide examples of finished produ

Boundary fill algorithm - output primitives, Boundary Fill Algorithm Bo...

Boundary Fill Algorithm Boundary fill algorithm is suitable when the boundary has single color while flood fill algorithm is more suitable for filling regions which are defined

Detecting skin in colour images, In this lab you will learn how to use chro...

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in im

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

Discuss in detail about rendering, Discuss in detail about rendering Co...

Discuss in detail about rendering Computer animation uses a technique termed as avars (animation variable) where starting point is generally a series of stick figures; for exam

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Objectives-visible-surface detection, After going through this section, you...

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

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