Download Assignment for unit 1 and unit 2 and more Study Guides, Projects, Research Computer Graphics in PDF only on Docsity!
Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology School of Computing Department of CSE Academic Year: 2021- Course Code / Course Name: 1151CS125/ Computer Graphics Sem: Summer Semester Faculty Name: Mr.V.JaganRaja / S Assignment – I CO Nos. Course Outcomes Level of learning domain (Based on revised Bloom’s taxonomy) CO Explain the basics of computer graphics, design algorithms for 2D output primitives
K
CO
Illustrate the concepts of viewing, projection, perspective, clipping and transformation in two dimensions.
K
S.No VTUNo Name Task
- VTU12003^ SHAKTHI UDHAI R
- VTU12004^ G HAASHWANTH 1
- VTU12016 S DINESH
- VTU12019^ SHEIK MOHAMED SHAFEER M M
- VTU12024^ KUTRALEESWARAN B 2
- VTU12036^ RIDIKA SHAKTHI V M
- VTU12037^ JOY MERLIN S
- VTU12038 G PRIYADHARSHINI 3
- VTU12048^ V PRASANNA
- VTU12049^ B SUCHITRA
- VTU12053^ SANOOP SADHEERTHAN P S 4
- VTU12056^ K DAYASAGARAN
- VTU12062 HEMANSAKTHIVEL D 5
- VTU12071^ M RUDHRA KUMAR
15. VTU12079^ MONESH R
16. VTU12097^ H B PUDHINRAJ
17. VTU12235 S ROHITH 6
18. VTU12319^ SUDANAGUNTA VENKATESWARLU
19. VTU12322 CHOWDAM HARSHITHA
20. VTU12324^ S VISHWASHRI 7
21. VTU12328^ VENNAPUSA CHARAN TEJA REDDY
22. VTU12399 RAJULA THARUN KUMAR REDDY
23. VTU12405^ SANDEPUDI SRI SINDHU 8
24. VTU12429 D.JEYAWARSHAHARITH
25. VTU15347^ S VISHNU PRASAD
26. VTU15353^ BODDAPATI HARSHAVARDHAN 9
27. VTU15357 SUDDAPALLI SAMPATH VARMA
28. VTU15380^ NERUDU GOMMU BHARATH SIMHA GOUD
29. VTU16042 ALURI SURENDRA 10
30. VTU16696^ DANDU SUBBAIAH
31. VTU16803^ SAGIN SANDOZ FERNANDO E
32. VTU16810 SANDEEP PRASAN KUMAR M G
33. VTU16876^ DOLA RAJADHANASAI
34. VTU16926 UPPUTURI LAKSHMI PUJITHA
35. VTU16934^ SRUTIMA JYOTI SURIN
36. VTU16938^ RACHAMADUGU SAI RAHUL
37. VTU16958 S VIJAYALAKSHMI
38. VTU17095^ CH JAYASIMHA REDDY
39. VTU17289 P PRAVEEN KUMAR REDDY
40. VTU17326^ JAJULA SAI BHANU PRAKASH
41. VTU17329^ M SAI VENKATA ADHITHYA
42. VTU17443 M SAI VAMSI
43. VTU17553^ K S S R PRASANNA
44. VTU17559 T ABHISHEK 14
Explain Sutherland Hodgman Polygon algorithm and Perform a clipping using a below given diagram CO2 K Task 2 S.N o Question Course Outcome Knowledge Level 1 Rasterization id the process used in Raster Scan Display with the help of electron beam turning the intensity on and off in scan line. The refresh buffer lays an important role in raster scan display With proper diagram, define Rasterization and illustrate the process of Raster scan display
CO1 K
Consider the line from (0, 0) to (-8,-4), illustrate Bresenham’s line algorithm to rasterize this line. Evaluate and tabulate all the steps involved CO1 K 3 Consider a square with (4,0), (0,0), (0,4), (4,4) Illustrate the steps of scaling with respect to x-axis is 2 units and with
CO2 K
respect to y-axis is 2 units. 4 Explain Sutherland Hodgman Polygon algorithm and Perform a clipping using a below given diagram CO2 K Task 3 S.No Question Course Outcome Knowledge Level 1 Explain midpoint circle drawing algorithm. Assume 10 cm as the radius and co-ordinate origin as the centre of the circle and find the intermediate points.
CO1 K
Suppose RGB raster system is to be designed using on 8 inch X 10 inch screen with a resolution of 100 pixels per inch in each direction. If we want to store 6 bits per pixel in the frame buffer, Summarize how much storage (in bytes) do we need for frame buffer?
CO1 K
Translate the square A(1,0), B(0,0), C(0,1), D(1,1). Rotate the square ABCD by 45degree clockwise about A(1,0).
CO2 K
Find the exact part of polygon lying inside the view volume Explain using Weiler-Atherton Polygon Clipping Algorithm CO2 K
Task 5 S.No Question Course Outcome Knowledge Level 1 Outline a line using DDA Algorithm from (5,6) to (8,12) CO1 K 2 Calculate the pixel location approximating, the first octant of a circle having centre at (4, 5) and radius 4 units. illustrate by using Bresenhams algorithm
CO1 K
Consider the square A(1,0), B(0,0), C(0,1), D(1,1). Rotate the square ABCD by 45degree anticlockwise about A(1,0). CO2 K 4 Explain Cohen Sutherland algorithm to clip line P (70,20) and p2(100,10) against a window lower left hand corner (50,10) and upper right hand corner (80,40).
CO2 K
Task 6 S.No Question Course Outcome Knowledge Level 1 Write down and explain the midpoint circle drawing algorithm. Assume 10 cm as the radius and co-ordinate origin as the centre of the circle.
CO1 K
Consider two raster systems with the resolutions of 640 x 480 and 1280 x 1024 What is the access time per pixel in each system?
CO1 K
Given a circle C with radius 10 and center coordinates (1, 4). Apply the translation with distance 5 towards X axis and 1 towards Y axis. Obtain the new coordinates of C without changing its radius.
CO2 K
Perform a 45degree rotation and to translate a triangle A(0,0, B(1,1), C(5,2) CO2 K Task 7 S.No Question Course Outcome Knowledge Level 1 Consider a raster system with the resolution of 1024 x 768 pixels and the color palette calls for 65,536 colors. What is the minimum amount of video RAM that the computer must have to support the above-mentioned resolution and number of colors?
CO1 K
2 Outline a line using DDA Algorithm from (0,0) to (4,6) CO1 K
Explain and Perform a clipping of a polygon using Sutherland - Hodgman Polygon using the below diagram CO2 K 4 Find the transformation matrix that transforms the square ABCD whose center is at (2,2) is reduced to half of its size, with center still remaining at (2,2). The coordinate of square ABCD are A(0,0), B(0,4), C(4,4) and D(4,0). Translate the co-ordinate of new square.
CO2 K
Task 9 S.No Question Course Outcome Knowledge Level 1 Consider three different raster systems with resolutions of 640 x 480, 1280 x 1024, and 2560 x 2048 Discuss how much storage (in bytes) is required for each system if 24 bits per pixel are to be stored?
CO1 K
As you have to scan-convert the line joining the points using DDA Algorithm (12,27) and (22, 44) CO1 K 3 Given a triangle with coordinate points A(3, 4), B(6, 4), C(5, 6). Apply the reflection on the Y axis and obtain the new coordinates of the object.
CO2 K
Let ABCD be the regular window with A(20,20),B(90,20),c(90,70)and D(20,70), find the region codes for endpoints and Explain using cohen Sutherland algorithm to clip the lines X(10,30) Y(80,9)
CO2 K
Task 10 S.No Question Course Outcome Knowledge Level 1 As you have to scan-convert the line joining the points outline using DDA Algorithm (15,26) and (26, 35)
CO1 K
Suppose a system with 8 inches by 10 inches video monitor that can display 100 pixels per inch. If memory is organized as one byte words, the starting frame buffer address is 0 and each pixel is assigned one byte of storage in memory, what is the frame buffer address of pixel with screen coordinates (x,y)? Also, interpret the total amount of memory consumed by the frame buffer.
CO1 K
Translate a triangle with coordinate points A(3, 4), B(6, 4), C(5, 6). Apply the reflection on the X axis and obtain the new coordinates of the object. CO2 K 4 Given a clipping window R(0,0),S(30,20),T(0,20) use the cohen Sutherland algorithm to determine and show the visible portion of the line A(10,30) and B(40,0)
CO2 K
Task 13 S.No Question Course Outcome Knowledge Level 1 If a tv screen has 525 scan lines and an aspect ratio of 3:4, and if each pixels contains 8-bits worth of intensity information, Demonstrate how many bits per second are required to show 30 frames each second?
CO1 K
As you have to scan-convert the line joining the points outline using DDA Algorithm (12,27) and (22, 44)
CO1 K
Given a line segment with starting point as (0, 0) and ending point as (4, 4). Translate 30 degree rotation anticlockwise direction on the line segment and find out the new coordinates of the line.
CO2 K
A window contains the size (0, 50, 0, 50). A line PQ has the coordinates (-10, 40) and (30, -20). Find and show the visible point of the line using midpoint subdivision.
CO2 K
Task 14 S.No Question Course Outcome Knowledge Level 1 How much time is spent in scanning across each row of pixels during screen refresh on a raster system Explain with a resolution of 640 by 480 and a refresh rate of 60 frames per second!
CO1 K
Calculate the pixel location approximating, outline the first octant of a circle having centre at (4, 5) and radius 4 units using Bresenhams algorithm CO1 K 3 Given a triangle with corner coordinates (0, 0), (1, 0) and (1, 1). Illustrate the stes of Rotating the triangle by 90 degree anticlockwise direction and find out the new coordinates.
CO2 K
4 A Clipping window ABCD is located as follows: A(100, 10), B(160, 10, C(160, 40), D(100, 40). Using Sutherland- Cohen clipping algorithm explain and find the visible
CO2 K
portion of the line segments EF, GH and P1P2. E(50,0), F(70,80), G(120, 20), H(140, 80), P1(120, 5), P2(180, 30) Task 15 S.No Question Course Outcome Knowledge Level 1 Explain How long would it take to load a 640×480 frame buffer with 12-bits per pixel, if 10^5 bits can be transferred per second?
CO1 K
Illustrate midpoint circle drawing algorithm. Assume 16 cm as the radius and co-ordinate origin as the centre of the circle and find the intermediate points. CO1 K 3 Given a circle C with radius 10 and center coordinates (1, 4). Apply the translation with distance 5 towards X axis and 1 towards Y axis. Obtain the new coordinates of C without changing its radius.
CO2 K
Using Sutherland-Hodgeman polygon explain how clipping algorithm clip on the polygon given below. CO2 K Task 16 S.No Question Course Outcome Knowledge Level 1 Explain how much time is spent in scanning across each row of pixels during screen refresh on a raster system with are solution of 1280 by 1024 and a refresh rate of 60 frames per second Assume horizontal and vertical retrace times are negligible
CO1 K
2 Outline a line from (1,1) to (8,7) using Bresenham’s Line Algorithm
CO1 K
