Check if a point lies inside a convex polygon | Algorithm Tutor

Check if a point lies inside a convex polygon | Algorithm Tutor

There are many problems where one needs to check if a point lies completely inside a convex polygon. Before moving into the solution of this problem, let us first check if a point lies left or right of a line segment. A polygon consists of more than two line segments ordered in a clockwise or anti-clockwise fashion. If a point lies left (or right) of all the edges of a polygon whose edges are in anticlockwise (or clockwise) direction then we can say that the point is completely inside the polygon.

Read full article from Check if a point lies inside a convex polygon | Algorithm Tutor