Computer Graphics
Computer Graphics
SCT211-0765/2022
1. AI (Adobe Illustrator)
• Type: Vector
• Application: Used for creating logos, icons, and detailed illustrations due to its scalability
without loss of quality.
• Application: Used in Windows applications for scalable graphics, clip art, and printing.
• Type: Vector
• Application: Used for exchanging graphics between CorelDRAW and other applications.
• Type: Vector
• Application: Used in engineering, aviation, and military applications for technical diagrams.
• Type: Vector
• Application: Used in web design for scalable icons, illustrations, and animations.
• History: Part of the OpenDocument standard, developed for open-source office suites.
• Type: Vector
• Application: Used in LibreOffice Draw and OpenOffice for illustrations and charts.
• History: Developed by Adobe in the 1980s as a graphics format for high-quality printing.
• Type: Vector
• Type: Vector
• Application: Used in AutoCAD and other CAD software for architectural and engineering
drawings.
9. BMP (Bitmap)
• Abbreviation: Bitmap
• Type: Raster
• Type: Raster
• Application: Used for digital photography and web images due to its compression and
balance of quality.
• Type: Raster
• Application: Used for web animations and simple graphics with limited colors.
12. TIFF (Tagged Image File Format)
• Type: Raster
• Application: Used in professional photography, publishing, and scanning due to its high
quality and lossless compression.
• History: Developed in 1995 as a replacement for GIF, supporting transparency and lossless
compression.
• Type: Raster
• Application: Used for web images, UI elements, and graphics where transparency is needed
2.)
Steps:
For each y-value, compute the two closest x-values and assign intensities:
Pixel calculations:
2. Gupta-Sproull Algorithm
Steps:
m = (4-3) / (1-(-2)) = 1 /3
o Example:
3. Midpoint Algorithm
Steps:
1. Compute increments:
dx = 5−(−3) = 8, dy = −2−4 = −6
3. Iteration process:
o Start at (-3,4).
Steps:
1. Calculate increments:
P0 = 2dy – dx = 2(3) – 1 = 5
3. Iteration:
o Start at (1,5).
Steps:
1. Compute increments:
dx = −1 − 0 = −1, dy = 4 − 2 = 2
3. Iteration:
o Start at (0,2).
6. DDA Algorithm
Steps:
1. Compute steps:
dx = 10 – 5 = 5, dy = 3 − 2 = 1
Steps = max(|dx|, |dy|) = 5.
Compute increments:
Generate points: