Triangle with no point inside
Given N points in 2-dimensional space, we need to find three points such that triangle made by choosing these points should not contain any other points inside. All given points will not lie on the same line so solution will always exist.
In above diagram possible triangle with no point inside can be formed by choosing these triplets, [(0, 0), (2, 0), (1, 1)] [(0, 0), (1, 1), (0, 2)] [(1, 1), (2, 0), (2, 2)] [(1, 1), (0, 2), (2, 2)] So any of the above triplets can be the final answer.
The solution is based on the fact that if there exist triangle(s) with no points inside, then we can form a triangle with any random point among all points.
We can solve this problem by searching all three points one by one. The first point can be chosen randomly. After choosing the first point, we need two points such that their slope should be different and no point should lie inside the triangle of these three points. We can do this by choosing the second point as nearest point to the first and third point as second nearest point with the different slope. For doing this, we first iterate over all points and choose the point which is nearest to the first one and designate that as second point of the required triangle. Then we iterate one more time to find point which has different slope and has the smallest distance, which will be the third point of our triangle.
0, 0 1, 1 0, 2
Time complexity: O(n)
Auxiliary Space: O(1)
This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.