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

CRT, why there is coating of phosphorous on CRT screen?

why there is coating of phosphorous on CRT screen?

Write a c-code that plots an object on the window, Write a C-code that plot...

Write a C-code that plots an object on the window and on the user's click of mouse on the window, the object starts rotating continuously until the user presses the mouse again.

Three dimensional concepts and display methods, Three Dimensional Concepts ...

Three Dimensional Concepts and Display Methods   Imagine yourself taking a picture by a camera.  What do you normally do?  You specify a viewpoint and view direction and then s

How many key frames does a one-minute animation film, How many key frames d...

How many key frames does a one-minute animation film order along with no duplications need? Solution : One minute = 60 seconds Number of frames needed per second=24 Numbe

Polygon surfaces - curves and surfaces, Polygon Surfaces - Curves and Surfa...

Polygon Surfaces - Curves and Surfaces   By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

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

Basic transformations - 2-d and 3-d transformations, Basic Transformations ...

Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

Design a graphical user interface, 1. Implement proper exception handling m...

1. Implement proper exception handling mechanism for this application. 2. Display all data a. Search specific data (depending of the user selection, your application should e

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