在c ++中查找包含一组点的最小区域椭圆 [英] Find Minimum area ellipse enclosing a set of points in c++
问题描述
我有一组2D点。我需要找到包围所有点的最小面积椭圆。有人能够提出如何解决问题的想法。对于一个圆圈来说很简单。中心和点之间的最大距离。但是对于一个椭圆而言，它非常复杂，我不知道。我必须在c ++中实现这一点。
你的C ++代码，但它们包括深入讨论你需要做的有效算法。
https://www.cs.cornell.edu/cv/OtherPdf/Ellipse.pdf
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++.
These don't go as far as giving you C++ code, but they include in-depth discussion of effective algorithms for what you need to do. https://www.cs.cornell.edu/cv/OtherPdf/Ellipse.pdf 这篇关于在c ++中查找包含一组点的最小区域椭圆的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
$ b $
