Can anyone please help me with a tutorial on "How to check whether a point inside a Convex polygon " with complexity O(lg n). I know the O(n) approach which use ray casting algorithm. But i need a better approach for solving a certain problem. Thnx in advance :) .