Computer Graphics & Multimedia Application
UNIT-I: Introduction
The Advantages of Interactive Graphics, Representative Uses of Computer Graphics, Classification of Application Development of Hardware and software for computer Graphics, Conceptual Framework for Interactive Graphics, Overview, Scan: Converting Lines, Scan Converting Circles, Scan Converting Ellipses.
UNIT-II: Hardcopy & Display Technologies
Hardcopy Technologies, Display Technologies, Raster-Scan Display System, Video Controller, Random-Scan Display processor, Input Devices for Operator Interaction, Image Scanners, Working exposure on graphics tools like Dream Weaver, 3D Effects, etc. Clipping: Southland-Cohen Algorithm, Cyrus-Beck Algorithm, Midpoint Subdivision Algorithm.
UNIT-III: Geometrical Transformation
2D Transformation, Homogeneous Coordinates and Matrix Representation of 2D Transformations, composition of 2D Transformations, the Window-to-Viewport Transformations, Introduction to 3D Transformations Matrix.
UNIT-IV: Representing Curves & Surfaces
Polygon meshes, parametric Cubic Curves, Quadric Surface; Solid Modeling: Representing Solids, Regularized Boolean Set Operation, Primitive Instancing, Sweep Representations, Boundary Representations, Spatial Partitioning Representations, Constructive Solid Geometry, Comparison of Representations.
UNIT-V: Introductory Concepts
Multimedia Definition, CD-ROM and the multimedia highway, Computer Animation (Design, types of animation, using different functions), Uses of Multimedia, Introduction to making multimedia – The stage of Project, hardware & software requirements to make good multimedia, skills and Training opportunities in Multimedia, Motivation for Multimedia usage.

UNIT-I: Introduction to Computer Graphics & Multimedia Application

1. The Advantages of Interactive Graphics

2. Representative Uses of Computer Graphics

3. Classification of Applications

4. Development of Hardware and Software

5. Conceptual Framework for Interactive Graphics

This includes the stages of interaction:

6. Overview of Scan Conversion

Scan conversion is the process of converting geometric primitives (lines, circles, ellipses) into pixels for raster displays.

7. Scan Converting Lines

Lines are approximated by plotting intermediate points on a pixel grid.

Example: Bresenham’s Line Algorithm
Input: (x1, y1) and (x2, y2)
Step: Choose the nearest pixel to the theoretical line
Output: Set of pixels forming a line

Diagram:

• → plotted pixel
            (x1, y1) ●———●———●———●———(x2, y2)
                     ↑     ↑     ↑     ↑
                    Pixels chosen based on error term
            

8. Scan Converting Circles

Used to draw circular shapes using symmetry and efficient algorithms.

Example: Midpoint Circle Algorithm
Input: Radius r and center (xc, yc)
Use 8-way symmetry to reduce computation

Diagram:

Plot one-eighth and mirror it:
                    ●●●
                 ●       ●
                ●         ●
                 ●       ●
                    ●●●
            

9. Scan Converting Ellipses

Uses midpoint algorithm with two regions for x and y dominance.

Input: rx, ry (x and y radii), center (xc, yc)
Apply symmetry in all four quadrants

Diagram:

Ellipse (symmetrical on x and y axes):
                   ●●●●
                ●       ●
               ●         ●
                ●       ●
                   ●●●●
            

UNIT-II: Computer Graphics Technologies and Clipping Algorithms

1. Hardcopy Technologies

Hardcopy devices convert digital graphics into physical output:

2. Display Technologies

Types of display devices:

3. Raster-Scan Display System

Raster-scan systems draw graphics by illuminating pixels row-wise (scanlines).

Diagram:

Scanlines: →→→→
Pixels: [●●●●●●●]
Each pixel is addressed individually and refreshed regularly

4. Video Controller

It acts as the interface between display hardware and the CPU. It:

5. Random-Scan Display Processor

Also known as vector displays, they draw graphics using commands rather than pixels.

6. Input Devices for Operator Interaction

7. Image Scanners

Convert printed images or documents into digital form.

8. Working Exposure on Graphics Tools

9. Clipping

Clipping is the process of cutting parts of graphics that lie outside a defined region (viewport).

Southland-Cohen Algorithm

Efficient line clipping algorithm for rectangular clipping window using region codes.

Steps:
1. Assign region codes to endpoints
2. Use bitwise AND to test visibility
3. Recursively clip lines outside region
Diagram:
Region Codes: 1000 | 1001 | 1010
0000 | LINE | 0000
0100 | 0101 | 0110

Cyrus-Beck Algorithm

Used for clipping lines against convex polygonal windows.

Uses parametric line equation:
P(t) = P0 + t(P1 - P0), where 0 ≤ t ≤ 1
Calculates entering and exiting values of t
Diagram:
Convex polygon → line intersects → compute t-in and t-out

Midpoint Subdivision Algorithm

Recursively divides the line into halves and checks which part lies within the window.

1. Test if line segment is completely inside/outside
2. If partially inside, divide at midpoint
3. Repeat until clipped completely or fully outside
Diagram:
Initial Line → Midpoint → Divide → Test each part recursively

UNIT-II: Output Devices, Clipping Algorithms & Graphics Tools

1. Hardcopy Technologies

2. Display Technologies

3. Raster-Scan Display System

Displays the image as a matrix of pixels in a raster format.

Process:
→ Beam scans pixel row-by-row (left to right, top to bottom)
→ Frame buffer stores pixel color values

Diagram:

Scan direction:
→ ●●●●●●●●●●
→ ●●●●●●●●●●
→ ●●●●●●●●●●

4. Video Controller

5. Random-Scan Display Processor

Also called vector display; draws lines directly between points.

6. Input Devices for Operator Interaction

7. Image Scanners

8. Graphics Tools Exposure

9. Clipping Algorithms

Used to cut portions of graphics that fall outside a defined region (viewport).

Southland-Cohen Algorithm

Step-by-step:
1. Assign region codes to endpoints
2. Use bitwise operations to check visibility
3. If partially visible, clip against viewport boundaries
Diagram (region codes):
100 | 101 | 001
-----+-----+-----
100 | 000 | 001
-----+-----+-----
110 | 011 | 010

Cyrus-Beck Algorithm

P(t) = P1 + t(P2 - P1), where 0 ≤ t ≤ 1

Midpoint Subdivision Algorithm

UNIT-II: Hardcopy Technologies, Display Technologies, and Algorithms

1. Hardcopy Technologies

2. Display Technologies

3. Raster-Scan Display System

A raster-scan display system generates images by lighting up pixels in a grid pattern.

Example: A simple raster-scan display will start at the top-left corner and sweep across each row, lighting up pixels as it moves.

4. Video Controller

The video controller processes image data and converts it into signals to drive the display hardware.

5. Random-Scan Display Processor

Random-scan displays (also known as vector displays) render images directly using lines and geometric shapes.

6. Input Devices for Operator Interaction

7. Image Scanners

Devices that convert physical images into digital formats.

8. Working Exposure on Graphics Tools

Familiarization with graphics software tools used for creating, editing, and rendering images.

9. Clipping Algorithms

Clipping is the process of trimming the objects to fit within a specified region.

UNIT-V: Introductory Concepts & Multimedia Usage

1. Multimedia Definition

Example: An interactive educational website combining text, videos, and animations.

2. CD-ROM and the Multimedia Highway

3. Computer Animation

3.1 Design

Example: A simple walking animation with keyframes showing different stages of movement.

3.2 Types of Animation

3.3 Using Different Functions in Animation

Example: A 3D object rotating around an axis using transformation functions in software.

4. Uses of Multimedia

5. Introduction to Making Multimedia

5.1 The Stages of a Multimedia Project

5.2 Hardware & Software Requirements

5.3 Skills and Training Opportunities in Multimedia

6. Motivation for Multimedia Usage

Example: A company using interactive 3D product demos to increase customer engagement.