Title | |
---|---|
An -------------test is used to check whether a point is inside or outside of the polygonAn -------------test is used to check whether a point is inside or outside of the polygon.
The answer is:
A. inside
|
|
In an inside test if number of intersections are ---------------- then point is inside of the polygon. Note : intersection point is not a vertexIn an inside test if number of intersections are ---------------- then point is inside of the polygon. Note: intersection point is not a vertex.
The answer is:
B. odd
|
|
In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note : intersection point is not a vertexIn an inside test if number of intersections is odd then point is ---------------- of the polygon. Note: intersection point is not a vertex
The answer is:
A. inside
|
|
In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same side of constructed horizontal line then the number of intersections are considered as ----------. Note : intersection point is a vertexIn an inside test if intersections point is a vertex and edges meeting at that vertex lies on same side of constructed horizontal line then the number of intersections are considered as ----------. Note: intersection point is a vertex
The answer is:
A. even number
|
|
In an inside test if intersections point is a vertex and edges meeting at that vertex lies on ------------- side of constructed horizontal line then the number of intersections are considered as even number . Note : intersection point is a vertexIn an inside test if intersections point is a vertex and edges meeting at that vertex lies on ------------- side of constructed horizontal line then the number of intersections are considered as even number . Note : intersection point is a vertex
The answer is:
A. same
|
|
Two inside polygon test methods are __________ and ________Two inside polygon test methods are __________ and ________
The answer is:
A. even odd method , winding number method
|
|
The 8-Fill Polygon technique will correctly fill the triangle shown below when seeded at the position shown with an XThe 8-Fill Polygon technique will correctly fill the triangle shown below when seeded at the position shown with an X.
The answer is:
B. false
|
|
Following is the method for inside test of the polygonFollowing is the method for inside test of the polygon.
The answer is:
A. even-odd method
|
|
Every side in winding number method has given a number calledEvery side in winding number method has given a number called
The answer is:
A. winding number
|
|
The total of the winding no. in winding number method of inside test is called asThe total of the winding no. in winding number method of inside test is called as
The answer is:
C. net winding.
|
|
Winding number method always gives correct answer for overlapping polygonsWinding number method always gives correct answer for overlapping polygons
The answer is:
B. false
|
|
Inside tests of polygon are useful in --------Inside tests of polygon are useful in --------
The answer is:
A. polygon filling
|
|
Even-odd method of inside test counts ----- to decide the position of a pointEven-odd method of inside test counts ----- to decide the position of a point.
The answer is:
C. intersections
|
|
In winding number method an ------------------ edges ------ consideredIn winding number method an ------------------ edges ------ considered
The answer is:
A. horizontal , not
|
|
Even-odd method of inside test is suitable for------Even-odd method of inside test is suitable for------
The answer is:
A. polygons
|
|
In winding number method an edge can have winding number as -----In winding number method an edge can have winding number as -----
The answer is:
B. +1 or -1
|
|
If the pixel is already filled with desired color then does nothing, otherwise fills it. This is calledIf the pixel is already filled with desired color then does nothing, otherwise fills it. This is called
The answer is:
B. boundary fill algorithm
|
|
The algorithm used for filling the interior of a polygon is calledThe algorithm used for filling the interior of a polygon is called
The answer is:
A. flood fill algorithm
|
|
___________ procedure accepts the coordinates of an internal point___________ procedure accepts the coordinates of an internal point.
The answer is:
B. boundary fill.
|
|
In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixelsIn 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixels.
The answer is:
A. 8
|
MCQs
Views
Best Answers
Points