
Computer Graphics Set A

tarix  07.11.2018  ölçüsü  33,5 Kb.   #78493 
 
What is the name given to the process of converting each primitive from its geometric definition into set of pixels that make up the primitive in the image space?

Rasterization

scan conversion

b only

Both a and b

What is true about DDA algorithm for scan conversion of a line

General purpose method

Incremental

current calculation is independent of previous step

Is slower than the use of line equation

In DDA algorithm for scan conversion of line

if m<=1 then dx=1

if m>=1 then dx=1

if m<=1 then dy=1

none of the above

Which of these is true about Bresenham's Line Algorithm?

Highly efficient incremental method.

Uses scan conversion

uses integer addition,subtraction and multiplication by 2

all of the above

Integer addition,subtraction and multiplication by 2 in Bresenham's Line Algorithm can be done by

Simple arithmetic shift operation

circular shift operation

XOR Operation

None of the above.

In Bresenham's algorithm for scan conversion of line

d=2dydx

d=2dxdy

d=4dydx

d=4dxdy

What is the basis of scan conversion of a circle?

Semicircle symmetry

Quarter symmetry

Eightway symmetry

None of the above

What is true about the Bresenhem's Circle algorithm?

if d<0 then d=d+4x+6.

if d>0 then d=d+4x+6.

if d<0 then d=d+4(xy)+10 and y.

None of the above

which of these is a characteristic of midpoint circle algorithm?

Produces pixel points for an semicircle.

Produces pixel points for an quadrant.

Produces pixel points for an octant.

none of the above

What is the initial value for the decision parameter in midpoint circle algorithm

5/4r

4/5r

r5/4

r4/5

Which of these is false for Boundaryfill algorithm

recursive algorithm

begins with a starting point called seed

It checks for any pixel to be boundary color.

Works only for rectangles and circles

Which of these is false for Floodfill algorithm

nonrecursive algorithm

begins with a starting point called seed

It checks for any pixel to be boundary color.

Works for regions to be filled has no uniformly colored boundary.

Which type of lines are ignored in scanline algorithm to fill regions?

Vertical.

Horizontal.

Left inclined

Right inclined.

Which type data structure is used for efficient implementation of scanline algorithm to fill regions?

Node list.

Edge list.

Stack.

None of the above.

scanline algorithm to fill regions efficient for

irregular regions.

Circle

Polygon.

None of the above.

Which of these is not a distortion produced by the scan conversion are:

Jaggies

Equal brightness

Antialiasing

Picket Fence Problem

Process that converts object coordinates in World Coordinates to Normalized Device Coordinates

viewport to Window mapping

Workstation transformation

Normalization.

Window to viewport mapping

What is the aim of Line clipping Algorithms?

deciding spatial relationship between line and clipping window

Finding intersection points.

both a and b

a only

Which of the following are not for line clipping?

CohenSutherland algorithm

Midpoint subdivision

Liang Barsky Algorithm

SutherlandHodgeman Algorithm

Which of the following use binary search to process a line?

CohenSutherland algorithm

Midpoint subdivision

Liang Barsky Algorithm

SutherlandHodgeman Algorithm
Answers
1d

2b

3a

4a

5b

6a

7c

8a

9c

10a

11d

12a

13b

14b

15c

16b

17d

18c

19d

20b

Dostları ilə paylaş: 

