You are given $n$ points on the plane, no three of which are collinear. Therefore, there is always exactly one circle that passes through any three of the given points. Please choose any three points such that its corresponding circle encloses the $n$ points.
Let's say $S$ is the set of the $n$ points.
Also, one observation of the statement says: ''The problemsetter’s solution has cost $Θ(n)$."
The first algorithm I thought was:
- Calculate the centroid $C$ of $S$.
- Sort $S$ so that $S_i$ is further (squared Euclidean distance) from $C$ than $S_{i+1}$.
- $\triangle S_0S_1S_2$ is the desired triangle.
Of course, this algorithm is incorrect.
This is a counterexample:
Any triangle can be formed with $S_0$, $S_1$ and $S_2$, in this case.
The second algorithm I thought was:
- Calculate the centroid $C$ of $S$.
- Obtain point $A$ so $d(A, C) \geq d(A, X)$, for all $X \in S$ ($A$ is the furthest point from $C$).
- Obtain the furthest point to $A$ in $S - \{A\}$. This is $B$.
- And then, find a point $C$ so that $d(C, A) + d(C, B)$ is maximum in $S-\{A, B\}$.
- Triangle solution is $\triangle ABC$.
This solution is $\Theta(n)$ and seems correct. Of course, to seem correct means nothing.
Is my solution correct? If not, can you help me finding the algorithm that solves this problem? (Or, even better...) Can you give me a hint?

*This always produces an enclosing circle. If a new circle $\Gamma'$ is formed from the diameter and the chosen third point X: