New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Unexpected results on sets of points #5
Comments
Hi. |
Also the code computes only the closest ellipsoid to the one with data points on its surface not enclosing all the points. Your data seem to be not suited for that and your results may as well be the closest to that kind of ellipsoids. |
I think what you need is minimum value enclosing ellipsoid like https://github.com/minillinim/ellipsoid |
Another option which may be good enough for classification is to construct a convex hull first, then compute an ellipsoid fitting it with this (my) repo. |
Hi @aleksandrbazhin, thanks for your replies. What I need is to adjust an ellipsoid with minimum error to a set of points that are not necessarily placed in a 2D manifold (i.e. there may be no surface embedded in 3D that has all the points). If I understand correctly, your code wouldn't be suited for this task. Would the one you linked work for this? I could construct the convex hull and select the points that are placed in the surface. Would that be enough to build an ellipsoid with your code? Thanks, |
Yes, the code I linked seems to do the job - find the minimal ellipsoid to contain all the points, but I did not look into the code. |
Tried to describe my view on situation at #11 |
Hi @aleksandrbazhin,
I am interested on using your code for some applications on molecular characterization. However, when I compute the ellipsoid for certain point sets I find unexpected results. See below the screenshots of the outcome.
I also find the following warning when running over the 1st set:
Could you please assist? I can share the data if needed.
Best,
Ismael.
The text was updated successfully, but these errors were encountered: