Exact primitives for smallest enclosing ellipses

Authors:
Bernd Gärtner;Sven Schönherr
Affiliations:
Institut für Informatik, Freie Universität Berlin, Takustr. 9, D-14195 Berlin, Germany;Institut für Informatik, Freie Universität Berlin, Takustr. 9, D-14195 Berlin, Germany
Venue:
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Year:
1997

Citing 3
Cited 4

A subexponential bound for linear programming

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A class of convex programs with applications to computational geometry

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio

Mathematical Programming: Series A and B

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

Journal of Global Optimization
Incremental procedures for partitioning highly intermixed multi-class datasets into hyper-spherical and hyper-ellipsoidal clusters

Data & Knowledge Engineering
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

Discrete Applied Mathematics
Conditional minimum volume ellipsoid with application to multiclass discrimination

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract