# Computer Graphics Set A

Yüklə 25,03 Kb.
 tarix 07.11.2018 ölçüsü 25,03 Kb.

Computer Graphics Set A

1. 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?

1. Rasterization

2. scan conversion

3. b only

4. Both a and b

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

1. General purpose method

2. Incremental

3. current calculation is independent of previous step

4. Is slower than the use of line equation

3. In DDA algorithm for scan conversion of line

1. if |m|<=1 then dx=1

2. if |m|>=1 then dx=1

3. if |m|<=1 then dy=1

4. none of the above

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

1. Highly efficient incremental method.

2. Uses scan conversion

3. uses integer addition,subtraction and multiplication by 2

4. all of the above

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

1. Simple arithmetic shift operation

2. circular shift operation

3. XOR Operation

4. None of the above.

6. In Bresenham's algorithm for scan conversion of line

1. d=2dy-dx

2. d=2dx-dy

3. d=4dy-dx

4. d=4dx-dy

7. What is the basis of scan conversion of a circle?

1. Semi-circle symmetry

2. Quarter symmetry

3. Eight-way symmetry

4. None of the above

8. What is true about the Bresenhem's Circle algorithm?

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

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

3. if d<0 then d=d+4(x-y)+10 and y--.

4. None of the above

9. which of these is a characteristic of midpoint circle algorithm?

1. Produces pixel points for an semicircle.

2. Produces pixel points for an quadrant.

3. Produces pixel points for an octant.

4. none of the above

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

1. 5/4-r

2. 4/5-r

3. r-5/4

4. r-4/5

1. Which of these is false for Boundary-fill algorithm-

1. recursive algorithm

2. begins with a starting point called seed

3. It checks for any pixel to be boundary color.

4. Works only for rectangles and circles

2. Which of these is false for Flood-fill algorithm-

1. non-recursive algorithm

2. begins with a starting point called seed

3. It checks for any pixel to be boundary color.

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

3. Which type of lines are ignored in scan-line algorithm to fill regions?

1. Vertical.

2. Horizontal.

3. Left inclined

4. Right inclined.

4. Which type data structure is used for efficient implementation of scan-line algorithm to fill regions?

1. Node list.

2. Edge list.

3. Stack.

4. None of the above.

5. scan-line algorithm to fill regions efficient for

1. irregular regions.

2. Circle

3. Polygon.

4. None of the above.

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

1. Jaggies

2. Equal brightness

3. Anti-aliasing

4. Picket Fence Problem

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

1. view-port to Window mapping

2. Workstation transformation

3. Normalization.

4. Window to view-port mapping

8. What is the aim of Line clipping Algorithms?

1. deciding spatial relationship between line and clipping window

2. Finding intersection points.

3. both a and b

4. a only

9. Which of the following are not for line clipping?

1. Cohen-Sutherland algorithm

2. Midpoint subdivision

3. Liang Barsky Algorithm

4. Sutherland-Hodgeman Algorithm

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

1. Cohen-Sutherland algorithm

2. Midpoint subdivision

3. Liang Barsky Algorithm

4. Sutherland-Hodgeman Algorithm
 1-d 2-b 3-a 4-a 5-b 6-a 7-c 8-a 9-c 10-a 11-d 12-a 13-b 14-b 15-c 16-b 17-d 18-c 19-d 20-b

Dostları ilə paylaş:

Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©genderi.org 2017
rəhbərliyinə müraciət

Ana səhifə