Bsc CSIT Semester 3 – Computer Graphics – Unit 2: Scan Conversion Algorithm (6 Hrs.)

Derive the expression for Bresenham’s Line Drawing algorithm. Trace the points in the line path with starting point (6, 12) and end point (10, 5) using Bresenham’s line drawing algorithm.

What is the major drawback of Sutherland Hodgeman Polygon Clipping Algorithm? Illustrate with a suitable example. Explain B-spline curve and its properties.

What do you mean by the refresh rate of a display device? Explain vector scan display with a suitable diagram.

Plot the first octant of a circle centered at (-2, -2), having a radius of 5 units using the mid-point circle algorithm.

What is a Digital Differential Analyzer (DDA)? How can you draw the line using this algorithm? Trace the points on the line path between A (1,3) and B (6,7) using Bresenham’s line drawing algorithm.

Why Liang Barsky Line Clipping Algorithm is efficient than Cohen Sutherland Algorithm? Explain the clipping procedure of Liang Barsky algorithm with suitable example.

Write down algorithm steps of mid-point ellipse drawing algorithm.

Explain the importance of filling algorithms in graphics applications. Differentiate between boundary and flood fill algorithm with algorithm.

Explain the working details of Mid-point circle algorithm? Trace the points along the line path having two end points (6,9) and (2,3) using Bresenham’s line drawing algorithm.

Plot the 1st octant of a circle centered at origin, having the radius 10 units.

Describe the requirement for line clipping. Explain the scan line polygon filling algorithm.

List the major differences between DDA and Bradenham’s Line drawing algorithm. Illustrate the DDA algorithm to the line width end points (2, 2) and (9, 2).

Let ABCD be the rectangle window with A(0, 0), B(10, 0), C(10, 10) and D(0, 10). Use Liang Barsky line clipping algorithm to clip the line XY where X(5, 3) and Y(15, 9)