Find Minimum area ellipse enclosing a set of points in c++
<p>I have a set of 2D points. I need to find a minimum area ellipse enclosing all the points. Could someone give an idea of how the problem has to be tackled. For a circle it was simple. The largest distance between the center and the point. But for an ellipse its quite complicated which I do not know. I have to implement this in c++. 
<a href="https://i.stack.imgur.com/T5My2.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/T5My2.jpg" alt="enter image description here"></a></p>