Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Computer Graphics Notes

    Uploaded by

    r6wnsf2dgp
    Hearn and Baker . Foley also

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Computer Graphics Notes

    Uploaded by

    r6wnsf2dgp
    2 views3 pages
    Hearn and Baker . Foley also

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Hearn and Baker . Foley also

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2 views3 pages

    Computer Graphics Notes

    Uploaded by

    r6wnsf2dgp
    Hearn and Baker . Foley also

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Bayesian probabilistic inference, Bayesian networks, Dempster-

    9
    Shafer theory, Introduction to fuzzy sets and fuzzy logic.
    Basic reasoning using fuzzy concepts, production rules, Chomsky
    10
    hierarchy of grammars, context-free grammars.
    11 Hill climbing and its variations, best first search.
    12 A* algorithm, constraint satisfaction problem, means-end analysis.
    Introduction to game playing, min-max procedure, alpha-beta
    13
    pruning.
    Overview of linguistics, Chomsky hierarchy of grammars, parsing
    14-15
    techniques..

    Assessment Methods
    Written tests, assignments, quizzes, presentations as announced by the instructor in the class.

    Keywords
    Artificial Intelligence, Problem Solving, Knowledge Representation, Reasoning, Uncertainty,
    Natural Language Processing

    Computer Graphics (BHCS14) Discipline Specific Core Course - (DSC)


    Credit: 06

    Course Objective
    This course introduces fundamental concepts of Computer Graphics with focus on modelling,
    rendering and interaction aspects of computer graphics. The course emphasizes the basic
    principles needed to design, use and understand computer graphics system.

    Course Learning Outcomes


    On successful completion of the course, students will be able to:
    1. Describe Standard raster and vector scan devices as well as Graphical Input and output devices
    2. Implement algorithms for drawing basic primitives such as linecircle and ellipse.
    3. Implement algorithms for line clipping and polygon clipping and filling.

    62
    4. Implement a 3D object representation scheme and carryout 2D and 3D Transformation, 3D
    projections
    5. Implement visible surface determination algorithms, Illumination models and surface
    rendering methods, color models
    6. Implement a simple computer animation algorithm

    Detailed Syllabus
    Unit 1
    Introduction: Introduction to Graphics systems, Basic elements of Computer graphics,
    Applications of computer graphics. Architecture of Raster and Random scan display devices,
    input/output devices.
    Unit 2
    Drawing and clipping primitives: Raster scan line, circle and ellipse drawing algorithms,
    Polygon filling, line clipping and polygon clipping algorithms
    Unit 3
    Transformation and Viewing: 2D and 3D Geometric Transformations, 2D and 3D Viewing
    Transformations (Projections- Parallel and Perspective), Vanishing points.
    Unit 4
    Geometric Modeling: Polygon Mesh Representation, Cubic Polynomial curves (Hermite and
    Bezier).
    Unit 5
    Visible Surface determination and Surface Rendering: Z-buffer algorithm, List-priority
    algorithm and area subdivision algorithm for visible surface determination. Illumination and
    shading models, RGB color model and Basics of Computer Animation.

    Practical
    1. Write a program to implement Bresenham’s line drawing algorithm.
    2. Write a program to implement mid-point circle drawing algorithm.
    3. Write a program to clip a line using Cohen and Sutherland line clipping algorithm.
    4. Write a program to clip a polygon using Sutherland Hodgeman algorithm.
    5. Write a program to fill a polygon using Scan line fill algorithm.
    6. Write a program to apply various 2D transformations on a 2D object (use homogenous

    63
    Coordinates).
    7. Write a program to apply various 3D transformations on a 3D object and then apply parallel
    and perspective projection on it.
    8. Write a program to draw Hermite /Bezier curve.

    References
    1. Baker, D.H. (2008). Computer Graphics. 2nd edition. Prentice Hall of India.
    2. Foley, J. D., Dam, A.V, Feiner, S. K., & Hughes, J. F. (1995). Computer Graphics: Principles
    and Practice in C. 2nd edition. Addison-Wesley Professional.

    Additional Resources:
    1. Bhattacharya, S. (2018). Computer Graphics. Oxford University Press
    2. Cohen, D. I. A. (2011). Introduction to Computer Theory. 2nd edition. Wiley India.
    3. Marschner, S., & Shirley, P. (2017) Fundamentals of Computer Graphics. 4th edition. CRC
    Press
    4. Rogers, D. F. (1989). Mathematical Elements for Computer Graphics. 2nd edition. McGraw
    Hill.

    Course Teaching Learning Process


    ● Use of ICT tools in conjunction with traditional class room teaching methods
    ● Interactive sessions
    ● Class discussions

    Tentative weekly teaching plan is as follows:

    64

    You might also like