In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.

Related MCQs

• 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.
• 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?
• If we want to recolor an area that is not defined within a single color boundary is known as_________.
• In perspective projections all projections are converge at a single point called as _____________________.
• In perspective projection line of projection converge at a single point called -----
• 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 vertex
• 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 vertex
• 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