IT- 601: Computer Graphics Lecture-00

1 / 16

# IT- 601: Computer Graphics Lecture-00 - PowerPoint PPT Presentation

Jesmin Akhter Lecturer,IIT Jahangirnagar University, Savar , Dhaka,Bangladesh. IT- 601: Computer Graphics Lecture-00. Course Overview. Tutorial 01 Introduction(L00 ) Scan Conversion(L01+L02+L03) Two – Dimnnsional Traformations (L04+L05+L06).

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## IT- 601: Computer Graphics Lecture-00

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
JesminAkhter

Lecturer,IIT

Jahangirnagar University,

### IT- 601: Computer GraphicsLecture-00

Course Overview
• Tutorial 01
• Introduction(L00)
• Scan Conversion(L01+L02+L03)
• Two – DimnnsionalTraformations(L04+L05+L06).
• ----------------------------------------------------------------
• Tutorial 02
• Two – Dimnnsional Viewing and Clipping(L07+L08+L09)
• Three – DimnnsionalTraformations(L10+L11+L12)
• Mathematics of Projection(L13+L14+L15)
• -----------------------------------------------------------------
• Tutorial 03
• Geometric Representation(L16+L17)
• Hidden Surfaces(L18+L19))
• Color Model(L20)
• ---------------------------------------------------------------
• Mathematics for two dimensional Computer Graphics(L21)
• Image Representation(L22)

2.5 Sets

2 Sets

1.5 Sets

1 Set

Course Policy
• No late homework is acceptable.
• Cheating directly affects the reputation of Department and the University and lowers the morale of other students.
• Cheating in homework and exam will not be tolerated.
• An automatic grade of 0 will be assigned for any student caught cheating.
• Presenting another person’s work as your own constitutes cheating.
Primary Focus

Develop thinking ability.

• problem solving skills.
• formal thinking.
Goals

Be very familiar with a collection of Computer Graphics algorithms.

Be intimately familiar with mathematics for Computer Graphics

Be able to apply techniques in practical problems.

Textbook & References
• Schaum’s ouTlines series, THEORY AND PROBLEM OF COMPUTER GRAPHICS ,Second Edition,McGraw Hill.
How to Succeed in this Course

Start early on all assignments. DON'T procrastinate.

Participate in class.

Think in class.

Review after each class.

Be formal and precise on all problem sets and in-class exams.

JesminAkhter

Lecturer,IIT

Jahangirnagar University,

### IT- 601: Computer GraphicsChapter 3Scan ConversionLecture-01

Scan Conversion
• Graphics System convert
• each primitive(points ,lines, circles, ellipses etc.) from its geometric definition into a set of pixels that make up the picture in the image space.
• This Conversion task is referred to as Scan Conversion.
Scan Converting a point
• (x,y) where x and y are real numbers within an image area.
• Need to be scan converted at pixel location
Line drawing is accomplished by calculating intermediate positions along the line path between two specified end points.

It is defined by the line equation y=mx+b, m is slope and b the y intercept of the line.

Two end points are p1(x1,y1) and p2(x2,y2)

Line equation describes the coordinates of all the points that lie between the two end points.

Scan Converting a line

y

y=mx+b

p2(x2,y2)

p1(x1,y1)

b

x

Direct use of the Line Equation
• Scan convert p1 and p2 to pixel coordinates
• then for every integer value of x between and excluding calculate the corresponding value of y using the equation and scan convert (x,y).
• then for every integer value of x between and excluding calculate the corresponding value of x using the equation and scan convert (x,y).

DDA Algorithm

• The digital differential analyzer (DDA) is an incremental scan-conversion method.
• Characterized by Performing calculations at each step using results from the preceding step.
• At each step i calculate (xi,yi) point on the line.
• Next point (xi+1,yi+1)

DDA Algorithm

Desired Line

(xi+1, Round(yj+m))

(xi, yj)

(xi+1, yj+m)

(xi, Round(yj))

y2

y1

x1

x2

(xi,Round(yi+m))

Desired Line

(xi,yi)

(xi,Round(yi))

(xi,yi +m)

DDA Algorithm
• DDA (“Digital Differential Analyzer”)
• Assume 0  m  1 .

void Line(int x0, int y0, int x1, int y1, int value) {double y = y0;

double m = (y1 – y0) / (x1 – x0); // 0 <= m <= 1for (int x = x0; x <= x1; x++) {

WritePixel(x, Round(y), value);

y += m; }

}

Require to eliminate floating point operations & variables

DDA ALGORITHM
• DDA algorithm is faster than the direct use of the line equation since it calculates points on the line without any floating point multiplication
• Cumulative error occurs.