Exact primitives for smallest enclosing ellipses
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3133180 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- A subexponential bound for linear programming
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Exact primitives for smallest enclosing ellipses
- Linear programming — Randomization and abstract frameworks
- Minimum Covering Ellipses
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- Optimal design: Some geometrical aspects of D-optimality
- Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
Cited in
(5)- Goffin's algorithm for zonotopes
- Distance field computation for geological slab surface data sets
- Exact primitives for smallest enclosing ellipses
- Smallest Ellipsoid Containing $p$-Sum of Ellipsoids With Application to Reachability Analysis
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
This page was built for publication: Exact primitives for smallest enclosing ellipses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293400)