Exact primitives for smallest enclosing ellipses
From MaRDI portal
Publication:293400
DOI10.1016/S0020-0190(98)00132-XzbMATH Open1339.68265MaRDI QIDQ293400FDOQ293400
Authors: B. Gärtner, Sven Schönherr 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909800132X?np=y
Recommendations
Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Title not available (Why is that?)
- A subexponential bound for linear programming
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- Exact primitives for smallest enclosing ellipses
- Title not available (Why is that?)
- Minimum Covering Ellipses
- Optimal design: Some geometrical aspects of D-optimality
- Linear programming — Randomization and abstract frameworks
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- Ü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
Uses Software
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)
