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

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 inside the polygon, all points on the line segment connecting them are __________the Polygon
• In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
• The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.
• 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 Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
• In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
• if any two point Pi(xi, yi) is considered, then it lies on the line on the line segment y = mx+b if………
• 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.
• slope of the line joining the points(1,2) and (3,4) is…….