CGAL users discussion list

[alex Dowson <>]

Hi

 

In CGAL any code for Maximum volume Inscribed ellipsoid in 3D polyhedron ?

 

I want to find Interior-point algoritham for the maximum volume ellipsoid problem or Maximum volume Inscribed ellipsoid in polyhedron . 

 

I checked for documentation but found only Minumum volume ellipsod covering from point set in nD (i.e. Approximate_min_ellipsoid_d.h).

 

Any one help me how can I implement using CGAL ?

 

 

Alex