A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
From MaRDI portal
Publication:2958363
DOI10.1007/978-3-319-48749-6_56zbMath1483.68464OpenAlexW2542804214MaRDI QIDQ2958363
Linus Källberg, Thomas Larsson
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_56
heuristicsfilteringpruningapproximation algorithmsLöwner ellipsoidsminimum-volume enclosing ellipsoids
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Cites Work
- Obstacle collision detection using best ellipsoid fit
- Minimum-volume enclosing ellipsoids and core sets
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Approximating the volume of convex bodies
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Eigenvalues of rank-one updated matrices with some applications
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Optimal design: Some geometrical aspects of D-optimality
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
