Rank: 1115 based on 107 downloads (last 30 days) and 3 files submitted
photo

Nima Moshtagh

E-mail
Company/University
UPenn, PA,USA

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Files Posted by Nima View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
20 Jan 2009 Screenshot Minimum Volume Enclosing Ellipsoid Computes the minimum-volume covering ellipoid that encloses N points in a D-dimensional space. Author: Nima Moshtagh optimization, minimum volume, enclosing, covering ellipsoid, ellipse, circle 49 20
  • 4.84615
4.8 | 13 ratings
16 Nov 2007 Screenshot Plot an ellipse in "center form" Draws 2D and 3D ellipses that are given in "center form". Author: Nima Moshtagh specialized, plotting, plot, ellipse, ellipsoid, minimum volume ellips... 42 14
  • 4.36364
4.4 | 11 ratings
27 Sep 2007 Screenshot Regular Polygons Plots the regular polygon {N/d} with vertices on a circle of radius 'rad'. Author: Nima Moshtagh regular polygon, graph, star polygon, mathematics, general 16 0
  • 5.0
5.0 | 2 ratings
Comments and Ratings by Nima View all
Updated File Comments Rating
14 Dec 2010 Voxel Draws a 3-D cube in a 3-D graph. Author: Suresh Joel

15 Oct 2010 PERMPOS all possible permutations of M values in N positions Author: Jos (10584)

17 Aug 2010 Plot an ellipse in "center form" Draws 2D and 3D ellipses that are given in "center form". Author: Nima Moshtagh

Here is a link to the (unpublished) paper describing the algorithm and math behind the code:

https://sites.google.com/site/nimamoshtagh/software/MVEE.pdf?attredirects=0

09 Jun 2010 Cone 3D cone connecting 2 points Author: Waldemar Swiercz

Thanks for the code!

03 Jun 2010 Minimum Volume Enclosing Ellipsoid Computes the minimum-volume covering ellipoid that encloses N points in a D-dimensional space. Author: Nima Moshtagh

Here is a link to the (unpublished) paper describing the algorithm and math behind the code:

https://sites.google.com/site/nimamoshtagh/software/MVEE.pdf?attredirects=0

Comments and Ratings on Nima's Files View all
Updated File Comment by Comments Rating
14 Aug 2014 Minimum Volume Enclosing Ellipsoid Computes the minimum-volume covering ellipoid that encloses N points in a D-dimensional space. Author: Nima Moshtagh David

Hmmm....
det(A) = pi^2 / area^2,

so it seems the optimization for minimum area is to maximize, rather than minimize, log(det(A)).

Also, for small d, it may be easier to obtain semi major/minor lengths (a, b) by finding the eigenvalues/vectors of A (eigenvalues are 1/a^2, 1/b^2, etc, rotation matrix columns are the eigenvectors).

I'm finding this algorithm gives me det(A) < 0 (a hyperbola) for some point sets. Also, A should be invariant under translation of all the input points (which should just result in a translation of c), but I find it is quite sensitive.

12 Jun 2014 Minimum Volume Enclosing Ellipsoid Computes the minimum-volume covering ellipoid that encloses N points in a D-dimensional space. Author: Nima Moshtagh Semechko, Anton

sweet, thanks!

10 Jun 2014 Minimum Volume Enclosing Ellipsoid Computes the minimum-volume covering ellipoid that encloses N points in a D-dimensional space. Author: Nima Moshtagh Pengju

28 Aug 2013 Plot an ellipse in "center form" Draws 2D and 3D ellipses that are given in "center form". Author: Nima Moshtagh lan

wonderful!!

17 Mar 2013 Minimum Volume Enclosing Ellipsoid Computes the minimum-volume covering ellipoid that encloses N points in a D-dimensional space. Author: Nima Moshtagh Javier

Hi,

thanks for sharing the code it's really good. One question, please could you explain me which it's the differente between this method and least squares?

Thank you very much

Contact us