Scribd
Upload
3 views2 pages

Suggestive questions-IT603A

The document contains a series of questions and topics related to computer graphics, including definitions of resolution and aspect ratio, differences between scan techniques, algorithms for hidden surface removal, line drawing, clipping, and transformations. It also covers Bezier curves, projection types, and various fill algorithms. Additionally, it includes practical problems involving calculations for frame buffer storage, coordinate transformations, and algorithm derivations.

Uploaded by

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

Suggestive questions-IT603A

The document contains a series of questions and topics related to computer graphics, including definitions of resolution and aspect ratio, differences between scan techniques, algorithms for hidden surface removal, line drawing, clipping, and transformations. It also covers Bezier curves, projection types, and various fill algorithms. Additionally, it includes practical problems involving calculations for frame buffer storage, coordinate transformations, and algorithm derivations.

Uploaded by

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

1. Define resolution, aspect ratio?

2. Differentiate between Random scan and raster scan technique with diagram.
3. Define Z-buffer algorithm for hidden surface removal.
4. Suppose an RGB raster system is to be designed using an 8 inch x 10 inch screen with are
solution of 100 pixels per inch in each direction. If we want to store 6 bits per pixel in the
frame buffer, then
a. How much storage in bytes do we need for the frame buffer?
b. Find out the Aspect ratio of the system
c. How much storage required in KB if 8bit/pixel are to be stored?
5. Consider a Bezier curve with control points P0(4,2), P1(8,8)and P2(16,4). What is the degree
of the curve? What are the coordinates at u=0.5?
6. Write down the properties of Bezier curve.
7. Derive mid-point circle drawing algorithm.
8. Define DDA line drawing algorithm? Derive DDA line drawing algorithm where |m|>1.
9. Digitize a line from (10, 12) to (20, 18) using Bresenham's LineDrawing Algorithm.
10. Differentiate between Raster and Random scan.
11. Define Cohen-Sutherland line clipping algorithm.
12. Lets assume, for window, Xwmin = 20, Xwmax = 80, Ywmin= 40, Ywmax = 80. and for
viewport, Xvmin = 30, Xvmax =60, Yvmin = 40, Yvmax = 60. Now calculate the coordinate
of apoint on viewport whose window port coordinate is ( 30, 80 ).
13. Prove that two successive Translations and Rotations are additive.
14. Write down the function of 8-connected Boundary fill process.
15. Define coherence property in scan line polygon filling.
16. State briefly different types of Parallel Projection.
17. Given a square object with coordinate points A(0, 3), B(3, 3),C(3, 0), D(0, 0). Apply the
scaling parameter 2 towards X axis and 3 towards Y axis and obtain the new coordinates of
the object.
18. A triangle is defined by
244
2 24
Find out the transformed coordinate after the 90-degree rotation with respect to origin and
reflection with respect to the line y=x.
19. State briefly different types of Parallel Projection.
20. Rasterizing the line from (1,1) to (8,7) using DDA line drawing algorithm.
21. Define scaling with diagram.
22. Define clipping, view port window.
23. Given a clipping window A(20,20), B(60,20), C(60,40) andD(20,40). With the help of Cohen
Sutherland algorithm calculate the visible portion of line segment joining the points P(40,80)
and Q(120,30).
24. Explain Cohen-Sutheland line clipping algorithm with example.
25. Differentiate between Flood fill and Boundary fill algorithm.
26. Write down the function of 8-connected Boundary fill process.
27. Define coherence property in scan line polygon filling.
28. Define Projection with diagram.
29. Write Short note-CRT, Parallel and perspective projection, Additive color model, 2D
Rotation, Shadow masking technique.
30. Define seed fill algorithm.
31. Contrast the seed fill and scan line fill algorithm.
32. Write down the differences between Bezier Curve and B-spline Curve.
33. Derive mid-point circle drawing algorithm.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy