Topic outline

  • General

  • Welcome To Computer Graphics

    Dear Students, 
    Welcome to the CSE 421 Computer Graphics course. I, Sonia Nasrin, will be your co-pilot in this journey of learning. Let us ignite ourselves to start this journey at great speed.
    Sonia Nasrin
    Lecturer, Department of CSE
    Daffodil International University


    • Appointment in Google Calendar 

      Appointment in google Calendar  Calender 2022

    • Instruction Information:

      Sonia_Nasrin picture

      Instructor Details:

      Sonia Nasrin
      Lecturer
      Department of CSE
      Daffodil International University.
      Email: Sonia.cse@diu.edu.bd
      Phone: 01682648071


    • Course Rationale

      Computer Graphics is a 1-credit senior-level course that introduces the concepts and implementation of computer graphics. As one of the important subject areas of the study of computer science and information systems, this course will focus on the theoretical aspects and implementation of computer graphics using OpenGL.

      Course Objectives 

      • To understand design thinking skills across the disciplines of computer graphics.
      • To animate the efficiency of problem solving focus in relate to visualization of  the device.
      • To develop the effective skills in the implementation on computer graphics for the digital ages.

      Course Learning Outcomes(CO's)



      Assessment Plan



    • Assessment plan with mark distribution :

      Assessment

      Mark

      Tentative date/week

      Attendance

      07

      24th July – 12th December

      Quiz 01

      15

      23th August’22

      Quiz 02

      15

      6th September’22

      Quiz 03

      15

      21th November

      Presentation

      08

      3rd October & 10th October

      Assignment (Class work in BLC)

      05

      Before midterm

      Mid-term Examination

      25

      18th – 25th September

      Final Examination

      40

      15th – 26th December


    • Reference Books/ Materials

      1. Schaum's Outline of Computer Graphics by Ray Plastock, Gordon Kalley, Zhiang Xiang,
      Zhingang Xiang
      2. C Programming Using Turbo C++ by Robert Lafore
      3. Fundamentals of Computer Graphics, by Peter Shirley et al., ISBN 978-1568812694
      4. Interactive Computer Graphics: A Top-Down Approach with Shader-Based OpenGL by
      Shreiner and Angel, Pearson Education ISBN 9780273752264
      5. Computer Graphics: Principles and Practice by Foley, Van Dam, Feiner, & Hughes,
      Addison-Wesley ISBN 0201848406

    • Course Outline : Click Here

  • Quiz 04

    QUIZ 04

    Section: PC-C
    Time: 8.00 PM to 8.12 p.m.

    • Quiz 04; PC-C
      Opened: Saturday, 24 December 2022, 8:00 PM
      Closed: Saturday, 24 December 2022, 8:12 PM

  • Quiz

    Quiz 03 

    Section: PC-C

    Exam start : 7.45 p.m.

    • Quiz. Section: PC-C
      Opened: Friday, 9 December 2022, 7:45 PM
      Closed: Friday, 9 December 2022, 8:03 PM

  • Week 1

    Topics for discussion

               Lecture 1: Introduction to Computer Graphics

               Lecture 2: Video Display Devices: Refresh Cathode Ray Tubes, Raster & Random Scan displays, Color CRT Monitors, DVST & Flat panel displays

    Expected Learning Outcome:

        • Appreciate the use of Computer Graphics and it's real life Application.
        • Able to explain the core concepts of computer graphics, including output primitives, anti-aliasing, transformation and viewing in 2D.

    Book Chapter

    Chapter 1: A survey of Computer Graphics

    Chapter 2: Overview of Graphics System

  • Week 2


    Topics for discussion

    Lecture 3: Points and Lines, Line drawing Algorithm

    Lecture 4: DDA Algorithm- example with plot in a graph

    Expected Learning Outcome:

          • Able to understand the core concept of output primitives and transformation..
          • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 3: Output Primitives

                                     

  • Week 3


    Topics for discussion

    Lecture 5: Parameter Description of Bresenham Line Drawing Algorithm

    Lecture 6: Bresenham Line Drawing Algorithm Implementation with Example

    Expected Learning Outcome:

          • Able to understand the core concept of output primitives and transformation..
          • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 3: Output Primitives

  • Presentation


    • Presentation Guide Line

      • Evaluation Criteria (Gesture & posture, Body language, English Communication, Eye Contact, Knowledge/content, Handling Q & A )


    • Presentation Guide Line Details....

      • Each Team Contain maximum 3 members.
      • Everyone participation is mandatory
      • Time Limit: 12 Minutes each team
      • Video Presentation (On-site) and presentation slide is submitted to BLC
    • Presentation Slide Submission Link Assignment
      Opened: Saturday, 20 August 2022, 12:00 AM
      Due: Monday, 10 October 2022, 11:59 PM
      Make a submission

  • Week 4


    Topics for discussion

    Lecture 7: Properties of Circle, Circle Drawing Algorithm : Midpoint

    Lecture 8: Mid point circle drawing Algorithm Implementation

    Expected Learning Outcome:

            • Able to understand the core concept of output primitives and transformation..
            • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 3: Output Primitives


  • week 5


    Topics for discussion

    Lecture 10: Two-Dimensional Geometric Transformation
    Lecture 11:  Review Class (Previous Lecture)

                       

    Expected Learning Outcome:

        •  To evaluate the transformation of an object  and viewing in two dimensional way..
        •  To perform with the mathematical expression in a computational  display. 

    Book Chapter

    Chapter 5: Two-Dimensional Geometric Transformation

                                    


  • Week 7




    • Mid Term Syllabus:

      1. Application of Computer Graphics
      2. Video display devices
      3. Line Drawing Algorithm ( Bresenham)
      4. Circle algorithm.(Mid Point)
      5. 2D Transformation
      6. Antialiasing: Different antialiasing techniques.


    • MID TERM ASSESSMENT PLAN 

      Total Marks: 25

  • Week 6


    Topics for discussion

    Lecture 9: Antialiasing-Different techniques

                           

    Expected Learning Outcome:

          • Able to understand the resolution and projection of the output primitives.
          • Able to implement the algorithm to pictorial form in the objects. 

    Book Chapter

    Chapter 4: Attributes of Output Primitives 


  • week 8


    Topics for discussion

    Lecture 19: 3D Geometric Transformation


    Expected Learning Outcome:

            • Able to understand the core concept of output primitives and transformation..
            • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 11: Three-Dimensional Geometric & Modeling Transformation

                                 

  • Week 9


    Topics for discussion

    Lecture 12: Two-Dimensional Viewing, Window-to-Viewport Coordinate Transformation

    Lecture 13: Two-Dimensional Clipping,  Line Clipping Algorithm: Cohen-Sutherland

    Expected Learning Outcome:

          • Able to understand the core concept of output primitives and transformation..
          • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 6: Two-Dimensional viewing

  • Week 10


    Topics for discussion

    Lecture 14: Two-Dimensional Clipping,  Polygon Clipping Algorithm

    Lecture 15: Sutherland Hodgeman- Example

    Expected Learning Outcome:

          • Able to understand the core concept of output primitives and transformation..
          • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 6: Two-Dimensional viewing

                               

  • week 11


    Topics for discussion

    Lecture 16: Two-Dimensional Clipping,  Polygon Clipping Algorithm: Weiler -Atherton Polygon Clipping Algorithm

    Lecture 17: Example of Weiler- Atherton Polygon Clipping Algorithm

    Expected Learning Outcome:

          • Able to understand the core concept of output primitives and transformation..
          • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 6: Two-Dimensional viewing and clipping


  • Week 13


    Topics for discussion

    lecture 22 : Halftone Pattern and Dithering Techniques

    Lecture 23: Color Models and Color Applications

    Expected Learning Outcome:

    • Able to understand the core concept of output primitives and transformation..
    • Able to implement the algorithm rendering the graphics.

    Book Chapter

    Chapter 14: Illustration Models & surface rendering Methods

    Chapter 15: Color Models & Color Applications



  • Topic 19

    • Topic 20

      • Topic 21

        • Topic 22

          • Topic 23

            • Topic 24

              • Topic 25

                • Topic 26

                  • Topic 27

                    • Topic 28

                      • Topic 29

                        • Topic 30

                          • Topic 31

                            • Topic 32

                              • Topic 33

                                • Topic 34

                                  • Topic 35

                                    • Topic 36

                                      • Topic 37

                                        • Topic 38

                                          • Topic 39

                                            • Topic 40

                                              • Topic 41

                                                • Topic 42

                                                  • Topic 43

                                                    • Topic 44

                                                      • Topic 45

                                                        • Topic 46

                                                          • Topic 47

                                                            • Topic 48

                                                              • Topic 49