A convex polygon is a polygon such that for any two points inside the polygon, all points on the line segment connecting them are __________the Polygon

Related MCQs

• A ______ polygon is a polygon such that for any two points inside the polygon, all points on the line segment connecting them are also inside the Polygon
• A convex polygon is a polygon such that for any two points ____ the polygon, all points on the line segment connecting them are also ____ the Polygon
• In winding number method , constructed horizontal line between point Q and point P intersects two edges of the polygon with winding no. +1 and -1. Tell whether point Q is inside or outside and what is the net winding ? Note : Q is the point to be tested for inside test.P is point outside the polygon.
• In winding number method , constructed horizontal line between point Q and point P intersects edge of the polygon with winding no. +1 . Tell whether point Q is inside or outside and what is the net winding ? Note : Q is the point to be tested for inside test. P is point outside the polygon.
• Scan line polygon filling algorithm can be used for filling Convex polygon.
• A region S is ____, if for atleast 2 points x1 and x2 in S, the straight line segment connecting x1 and x2 is not contained entirely in S.
• One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 12. What will be the x-value of the intersection point of the scan line in i+1 th step?
• One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 14. What will be the x-value of the intersection point of the scan line in i+1 th step?
• A region S is ____ , iff for any x1 and x2 in S, the straight line segment connecting x1 and x2 is also contained in S.
• Deletion of any segment is much________ than creation of any new segment.