You can use Graham Scan to compute Convex hull of the given points. Once you have all the points on the convex hull you can eliminate the others.
There are other algorithms as well for computing convex hull, but Graham scan is easy to implement and is O(n logn).