Scribd
Upload
2 views

Assignment 3_ Computer Graphics

This document outlines Assignment 3 for the Computer Graphics course in the Department of Computer Science & Engineering for the 2023-24 academic session. It includes various questions related to 3D transformations, line drawing algorithms, graphics functions, clipping algorithms, and polygon filling techniques. The assignment emphasizes practical applications and evaluations of different algorithms and their efficiencies in computer graphics.

Uploaded by

singhprakash7277016715
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Assignment 3_ Computer Graphics

This document outlines Assignment 3 for the Computer Graphics course in the Department of Computer Science & Engineering for the 2023-24 academic session. It includes various questions related to 3D transformations, line drawing algorithms, graphics functions, clipping algorithms, and polygon filling techniques. The assignment emphasizes practical applications and evaluations of different algorithms and their efficiencies in computer graphics.

Uploaded by

singhprakash7277016715
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of Computer Scinence & Engineering

Session: 2023-24 Semester: 5th Section: CSE 1 ,2 ,3


Course Code: Course Name: Computer Graphics
Assignment 3

Date of Assignment: 17/10/2024 Last Date of Submission: 23/10/2024

S.No. Question

1 Differentiate between 3D Translation and Scaling

Consider and compare the DDA algorithm and the Bresenham's line algorithm for drawing a line
2 between two points (2, 3) and (8, 9). Find the coordinates of the points using both algorithms and
differentiate the differences in accuracy or efficiency.
Distinguish between various Graphics Functions such as translation, rotation, scaling, and clipping,
3 explaining their roles in image processing and manipulation

4. Differentiate between Sampling and Quantization

5. Understand the drawing a line from point A(2, 3) to point B(8, 6) using Bresenham's line drawing
algorithm.

7
How would you evaluate the Raster Methods for Transformations

8 Examine the Bresenham's line drawing algorithm by rasterizing the line from (-1, 1) to (5, -8) and
assess its accuracy and efficiency in drawing the line
Find the key differences between Cathode Ray Tubes (CRTs) and LCD monitors. Discuss the
9 advantages and disadvantages of each technology.
Verify the correctness of the Liang-Barsky line clipping algorithm by applying it to a given line
segment and a clipping window. Show step-by-step calculations and explain how the algorithm
10 efficiently determines whether the line segment is inside, outside, or partially inside the clipping
window. Discuss any possible edge cases and how the algorithm handles them.
Analyse the performance of the Bresenham's line drawing algorithm in terms of the number of
11 operations required and its ability to draw lines with integer coordinates, and discuss its advantages
and limitations
a) Illustrate the scan line algorithm for area filling in computer graphics. Verify how it works and
12 examine its advantages and limitations.
b) Write the significance of selecting suitable line styles and types in graphic design.
c)Explain how they contribute to enhancing the overall visual appeal of an artwork or design project.

(a) Prove the correctness of the Liang-Barsky Line Clipping algorithm and evaluate its advantages
over other line clipping algorithms
13 (b) Explain the Sutherland-Hodgeman Polygon Clipping algorithm and evaluate its ability to clip
concave and convex polygons against a convex clipping window

14 Prove the properties of Nonuniform B-Splines and evaluate their ability to create deformable
surfaces in computer graphics
Formulate a Boundary Fill algorithm to fill a closed polygon with the following vertices: A (2, 4), B
(5, 7), C (8, 4), D (5, 2). The fill color is red (RGB value: 255, 0, 0) and the boundary color is blue
(RGB value: 0, 0, 255). Assume that the algorithm starts from the point (3, 5) inside the polygon.
a) Step-by-step, outline the process of the Boundary Fill algorithm for this scenario. Include the
15 coordinates and colors at each step.
b) Calculate the total number of pixels filled by the algorithm.
c) Discuss one limitation or challenge that may arise when applying the Boundary Fill algorithm in
this scenario

You might also like