Exact primitives for smallest enclosing ellipses

DOI10.1016/S0020-0190(98)00132-XzbMath1339.68265MaRDI QIDQ293400

Sven Schönherr, Bernd Gärtner

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

zbMATH Keywords

computational complexitycomputational geometryLöwner-John ellipsoidprimitive operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Exact primitives for smallest enclosing ellipses ⋮ Distance field computation for geological slab surface data sets

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Exact primitives for smallest enclosing ellipses
• 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
• Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
• A subexponential bound for linear programming
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Minimum Covering Ellipses
• Optimal design: Some geometrical aspects of D-optimality
• Linear programming — Randomization and abstract frameworks

This page was built for publication: Exact primitives for smallest enclosing ellipses