Search results for graphics / GATE Overflow for GATE CSE

1 votes

2 answers

21

UGC NET CSE | June 2016 | Part 3 | Question: 17
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}$ ... $x'=x; y'=y.Sh_x$ $x'=x; y'=Sh_y(x-x_{ref})+y$ $x'=Sh_y.y; y'=y.(x-x_{ref})$

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 per...

go_editor

4.8k views

go_editor asked Aug 20, 2016

5 votes

3 answers

22

ISRO2008-74
A Steiner patch is Biquadratic Bezeir patch Bicubic patch Circular patch only Bilinear Bezier patch

A Steiner patch isBiquadratic Bezeir patchBicubic patchCircular patch onlyBilinear Bezier patch

go_editor

2.7k views

go_editor asked Jun 13, 2016

3 votes

2 answers

23

UGC NET CSE | June 2013 | Part 3 | Question: 27
Bresenham line drawing algorithm is attractive because it uses Real arithmetic only Integer arithmetic only Floating point arithmetic Real and integer arithmetic

Bresenham line drawing algorithm is attractive because it usesReal arithmetic onlyInteger arithmetic onlyFloating point arithmeticReal and integer arithmetic

go_editor

3.6k views

go_editor asked Jul 17, 2016

3 votes

3 answers

24

UGC NET CSE | June 2016 | Part 3 | Question: 16
In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinte extent. This is known as ____ View confusion Vanishing point Topological distortion Perspective foreshortening

In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinte e...

Meenakshi Sharma

3.0k views

Meenakshi Sharma asked Aug 13, 2016

2 votes

1 answer

25

ISRO2018-39
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$

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}\ ,...

Arjun

5.5k views

Arjun asked Apr 22, 2018

1 votes

1 answer

26

UGC NET CSE | August 2016 | Part 3 | Question: 15
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}$ ... $x_{ i+1} = x_{ i + 1} y_{i+1} = y_{i + 1} d_{i+1} = d_{i} + 2 (dy - dx)$

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 ne...

makhdoom ghaya

3.0k views

makhdoom ghaya asked Sep 30, 2016

1 votes

1 answer

27

UGC NET CSE | November 2017 | Part 3 | Question: 14
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

Which of the following is not true in case of Oblique Projections?Parallel projection rays are not perpendicular to the viewing planeParallel lines in space appear parall...

Arjun

4.0k views

Arjun asked Nov 5, 2017

0 votes

3 answers

28

UGC NET CSE | January 2017 | Part 3 | Question: 18
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)]$

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)...

go_editor

2.8k views

go_editor asked Mar 24, 2020

1 votes

2 answers

29

UGC NET CSE | December 2014 | Part 3 | Question: 17
In Cyrus-Beck algorithm for line clipping the value of $t$ parameter is computed by the relation: (Here $P_{1}$ and $P_{2}$ are the two end points of the line, $f$ is a point on the boundary, $n_{1}$ ... $\frac{(f_{i}-P_{2}).n_{i}}{(P_{1}-P_{2}).n_{i}}$

In Cyrus-Beck algorithm for line clipping the value of $t$ parameter is computed by the relation: (Here $P_{1}$ and $P_{2}$ are the two end points of the line, $f$ is a p...

makhdoom ghaya

2.2k views

makhdoom ghaya asked Jul 25, 2016

0 votes

2 answers

30

UGC NET CSE | January 2017 | Part 3 | Question: 16
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$

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)S...

go_editor

1.2k views

go_editor asked Mar 24, 2020

1 votes

1 answer

31

UGC NET CSE | September 2013 | Part 3 | Question: 60
A diametric projection is said to be trimetric projection when two of the three foreshortening factors are equal and third is arbitrary all of the three foreshortening factors are equal all of the three foreshortening factors are arbitrary Which of the above is true? I and II II and III I only III only

A diametric projection is said to be trimetric projection whentwo of the three foreshortening factors are equal and third is arbitraryall of the three foreshortening fact...

go_editor

2.1k views

go_editor asked Jul 24, 2016

5 votes

3 answers

32

ISRO2014-34
How much memory is required to implement $z$-buffer algorithm for a $512 \times 512 \times 24$ bit-plane image? $768$ KB $1$ MB $1.5$ MB $2$ MB

How much memory is required to implement $z$-buffer algorithm for a $512 \times 512 \times 24$ bit-plane image?$768$ KB$1$ MB$1.5$ MB$2$ MB

ninuarun

5.4k views

ninuarun asked May 31, 2016

2 votes

1 answer

33

UGC NET CSE | September 2013 | Part 3 | Question: 59
Which of the following graphics devices are known as active graphics devices? Alphanumeric devices Thumb wheels Digitizers Joystics I and II III and IV I, II and III I, II, III and IV

Which of the following graphics devices are known as active graphics devices?Alphanumeric devicesThumb wheelsDigitizersJoysticsI and IIIII and IVI, II and IIII, II, III a...

go_editor

1.4k views

go_editor asked Jul 24, 2016

4 votes

7 answers

34

ISRO2011-7
Which of the following is true about $z$-buffer algorithm? It is a depth sort algorithm No limitation on total number of objects Comparisons of objects is done $z$-buffer is initialized to background colour at start of algorithm

Which of the following is true about $z$-buffer algorithm?It is a depth sort algorithmNo limitation on total number of objectsComparisons of objects is done$z$-buffer is ...

go_editor

4.9k views

go_editor asked Jun 21, 2016

3 votes

1 answer

35

UGC NET CSE | Junet 2015 | Part 3 | Question: 14
Consider a triangle A(0,0), B(1, 1) and C(5, 2). The triangle has to be rotated by an angle of 45$^o$ ...

Consider a triangle A(0,0), B(1, 1) and C(5, 2). The triangle has to be rotated by an angle of 45$^o$ about the point P(-1, -1). What shall be the coordinates of new tria...

go_editor

15.2k views

go_editor asked Jul 31, 2016

1 votes

2 answers

36

UGC NET CSE | August 2016 | Part 3 | Question: 18
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$ ... as : $(0, \frac{2}{3})$ $\left(\frac{1}{6},\frac{5}{6}\right)$ $(0, \frac{1}{3})$ $(0, 1)$

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 g...

makhdoom ghaya

3.8k views

makhdoom ghaya asked Sep 30, 2016

0 votes

3 answers

37

UGC NET CSE | June 2014 | Part 3 | Question: 05
Which of the following color models are defined with three primary colors ? RGB and HSV color models CMY and HSV color models HSV and HLS color models RGB and CMY color models

Which of the following color models are defined with three primary colors ? RGB and HSV color modelsCMY and HSV color modelsHSV and HLS color modelsRGB and CMY color mode...

makhdoom ghaya

4.3k views

makhdoom ghaya asked Jul 4, 2016

0 votes

2 answers

38

UGC NET CSE | June 2014 | Part 3 | Question: 55
Given an image of size $1024 \times 1024$ pixels in which intensity of each pixel is an $8$-bit quality. It requires _______ of storage space if the image is not compressed. One Terabyte One Megabyte $8$ Megabytes $8$ Terabytes

Given an image of size $1024 \times 1024$ pixels in which intensity of each pixel is an $8$-bit quality. It requires _______ of storage space if the image is not compress...

makhdoom ghaya

5.0k views

makhdoom ghaya asked Jul 11, 2016

1 votes

2 answers

39

UGC NET CSE | June 2013 | Part 3 | Question: 19
An image is 1024$*$800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it make to transmit it over a 10 Mbps Ethernet? 196.6 seconds 19.66 seconds 1.966 seconds 0.1966 seconds

An image is 1024$*$800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it make to transmit it over a 10 Mbps Ethernet?196.6 seconds19.66 second...

go_editor

4.5k views

go_editor asked Jul 16, 2016

1 votes

2 answers

40

UGC NET CSE | November 2017 | Part 3 | Question: 15
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

With respect to CRT, the horizontal retrace is defined asThe path an electron beam takes when returning to the left side of the CRTThe path an electron beam takes when re...

Arjun

2.3k views

Arjun asked Nov 5, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true