Recent questions tagged computer-graphics

1
Below are the few steps given for scan-converting a circle using Bresenham’s Algorithm. Which of the given steps is not correct? Compute $d= 3-2r$ (where $r$ is radius) Stop if $x>y$ If $d< 0$, then $d=4x+6$ and $x=x+1$ If $d\geq 0$, then $d=4 \ast(x-y)+10, \: x=x+1$ and $y=y+1$
2
Which of the following is/are side effects of scan conversion? Aliasing Unequal intensity of diagonal lines Overstriking in photographic applications Local or Global aliasing a and b a,b and c a,c and d a,b,c and d
3
Consider a line $AB$ with $A=(0,0)$ and $B=(8,4)$. Apply a simple $DDA$ algorithm and compute the first four plots on this line. $[(0,0),(1,1),(2,1),(3,2)]$ $[(0,0),(1,1.5),(2,2),(3,3)]$ $[(0,0),(1,1),(2,2.5),(3,3)]$ $[(0,0),(1,2),(2,2),(3,2)]$
1 vote
4
A graphic display system has a frame buffer that is 640 pixels high , 480 pixels high and 1 bit of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately: 16 frames per second 19 frames per second 21 frames per second 23 frames per second
5
Which of the following statements is/are True regarding the solution of the visibility problem in 3D graphics? S1: The painter's algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen starting with the most nearest polygon S2: Backface Culling refers to eliminating geometry with backfacing normals S1 only S2 only Both S1 and S2 Neither S1 nor S2
6
Consider the matrix $M=\begin{bmatrix} 2 & 0 & 2 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}$ representing a set of planar (2D) geometric transformations in homogeneous coordinates. Which of the following statements about the matrix M is True? M represents first, a ... 1) followed by shearing of parameters (-1,1) M represents first, a shearing of parameters (-1, 1) followed by scaling of vector (3,1)
7
Which of the following statements is/are True regarding the solution to the visibility problem in $3D$ graphics ? $S1 :$ The Painter's algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen starting with the most nearest ... $S2 :$ Backface Culling refers to eliminating geometry with backfacing normals. S1 only S2 only Both S1 and S2 Neither S1 nor S2
1 vote
8
Perform window to viewport transformation for the point (20,15). Assume that $(X_{wmin}\ ,Y_{wmin} )$ is $(0,0)$ ; $(X_{wmax}\ ,Y_{wmax} )$ is $(100,100)$ ; $(X_{vmin}\ ,Y_{vmin} )$ is $(5,5)$ ; $(X_{vmax}\ ,Y_{vmax} )$ is $(20,20)$ . The value of $x$ and $y$ in the viewport is $x=4,y=4$ $x=3,y=3$ $x=8,y=7.25$ $x=3,y=4$
9
I have a confusion that how the Gpu internal memory different from primary memory in the sense when which of the memory is active. For example suppose i am doing GPU programming or playing a video game then primary memory plays a role or only GPU memory. Suppose I increased my RAM without touching GPU will there be any improvement in my Gpu programming or my video games.
1 vote
10
Which of the following is not true in case of Oblique Projections? Parallel projection rays are not perpendicular to the viewing plane Parallel lines in space appear parallel on the final projected image Used exclusively for pictorial purposes rather than formal working drawings Projectors are always perpendicular to the plane of projection
1 vote
11
With respect to CRT, the horizontal retrace is defined as The path an electron beam takes when returning to the left side of the CRT The path an electron beam takes when returning to the right side of the CRT The technique of turning, the electron beam off while retracing The technique of turning, the electron beam on/ off while retracing
1 vote
12
The three aspects of Quantization, programmers generally concerned with are Coding error, Sampling rate and Amplification Sampling rate, Coding error and Conditioning Sampling rate, Aperture time and Coding error Aperture time, Coding error and Strobing
1 vote
13
Which of the following is not a component of Memory tube display? Flooding gun Collector Ground Liquid Crystal
–1 vote
14
The reflection along the line y=x is equivalent to reflection along the X-axis followed by counter clockwise rotation by theta degrees.Find the value of theta
15
Show that the composition of two rotations is additive by concatenating the matrix representations for R(theta 1) and R(theta 2) to obtain R(theta 1) x R(theta 2) = R(theta 1 + theta 2)
16
Scan convert an Eclipse with given Eclipse parameters : Rx = 6 and Ry = 4 Please show the working.
17
Scan convert a circle with radius 9.5 and centerd at origin using Mid Point Circle Algorithm Please show working.
–1 vote
18
A polygon has 4 vertices located a A(25, 10),B(50, 10),C(60, 30),D(20 ,30).Specify the transformation matrix required to double the size of the polygon with point A located at the same position.
19
How long it would take to load a 512 x 480 frame buffer with 12 bits per pixel,if 1000 bits can be transferred per second?
1 vote
20
The Liang-Barsky line clipping algorithm uses the parametric equation of a line from $(x_{1} , y_{1} )$ to $(x_{2} , y_{2} )$ along with its infinite extension which is given as : $x = x_{1} + \Delta x.u$ $y = y_{1} + \Delta y.u$ ... -Barsky algorithm is given as : $(0, \frac{2}{3})$ $\left(\frac{1}{6},\frac{5}{6}\right)$ $(0, \frac{1}{3})$ $(0, 1)$
1 vote
21
In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and backward onto the view-plane. This is known as _____. Topological distortion Vanishing point View confusion Perspective foreshortening
22
A point $P(2, 5)$ is rotated about a pivot point $(1, 2)$ by 60°. What is the new transformed point $P'$ ? $(1, 4)$ $(–1, 4)$ $(1, – 4)$ $(– 4, 1)$
1 vote
23
Consider the Breshenham's line generation algorithm for a line with gradient greater than one, current point $(x_{ i} , y_{i} )$ and decision parameter, $d_{i}$. The next point to be plotted $(x _{i+1}, y_{i+1})$ and updated decision parameter, $d_{i+1}$, for $d_{i} < 0$ ... $x_{ i+1} = x_{ i + 1} y_{i+1} = y_{i + 1} d_{i+1} = d_{i} + 2 (dy - dx)$
24
Consider a $N$-bit plane frame buffer with $W$-bit wide lookup table with $W > N$. How many intensity levels are available at a time ? $2^{N}$ $2^{W}$ $2^{N+W}$ $2^{N-1}$
1 vote
25
Consider a raster grid having $XY$-axes in positive $X$-direction and positive upward $Y$-direction with $X_{max} = 10$, $X_{min} = –5$, $Y_{max} = 11$, and $Y_{min} = 6$. What is the address of memory pixel with location $(5, 4)$ in raster grid assuming base address $1$ (one) ? $150$ $151$ $160$ $161$
26
Which of the following is used for the boundary representation of an image object? Quad Tree Projections Run length coding Chain codes
27
Which of the following statements is/are correct with reference to curve generation? Hermite curves are generated using the concepts of interpolation Bezier curves are generated using the concepts of approximation The Bezier curve lies entirely within the convex hull of its control points The degree ... number of control points I, II and IV only II and III only I and II only I, II and III only
1 vote
Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further Sh$_x$ and Sh$_y$ are shearing factors in x and y directions. If we perform the y direction shear relative to x=s$_{ref}$ then the transformed point is given by $x’=x+Sh_x.(y-y_{ref}); y’=y$ $x’=x; y’=y.Sh_x$ $x’=x; y’=Sh_y(x-x_{ref})+y$ $x’=Sh_y.y; y’=y.(x-x_{ref})$
Consider the Breshenman's circle generation algorithm for plotting a circle with centre (0,0) and radius 'r' unit in first quadrant. If the current point is $(x_i, y_i)$ and decision parameter is $p_i$ then what will be the next point $(x_{i+1}, y_{i+1})$ and updates decision parameter $p_{i+1}$ ... $x_{i+1}=x_i-1; y_{i+1}=y_i; p_{i+1}=p_i+4x_i+10$