Computer Graphics

111. If a line joining any of its two interior points lies completely within it are called

1. Convex polygon
2. Concave polygon
3. Both a & b
4. None of these

View answer

112. If a line joining any two of its interior points lies not completely inside are called

1. Convex polygon
2. Concave polygon
3. Both a & b
4. None of these

View answer

113. If the pixel is already filled with desired color then leaves it otherwise fills it. this is called

1. Flood fill algorithm
2. Boundary fill algorithm
3. Scan line polygon filling algorithm
4. None of these

View answer

114. If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called

1. Negatively oriented
2. Positively oriented
3. Both a & b
4. None of these

View answer

115. If the visit to the vertices of the polygon in the given order produces an clockwise loop are called

1. Negatively oriented
2. Positively oriented
3. Both a & b
4. None of these

View answer

116. In beam penetration method of color CRT, two layer of phosphor coated are

1. Red and blue
2. Red and green
3. Blue and green
4. None of these

View answer

117. In beam penetration method of color CRT, which layer is red and which is green

1. Outer is red and inner is green
2. Inner is red and outer is green
3. Inner is red and inner is green
4. None

View answer

118. In computer graphics, a graphical object is known as

1. Point
2. Segment
3. Parameter
4. None of these

View answer

119. In DUST, is there refresh buffer

1. Yes
2. No
3. Both
4. None

View answer

120. In orthographic projection, engineering use

1. Top view of an object
2. Front view of an object
3. Side view of an object
4. All of these

View answer