Minimal ellipsoids and maximal simplexes in 3D Euclidean space

DOI10.1023/B:CASA.0000020224.83374.d7zbMath1097.52004OpenAlexW1967391761MaRDI QIDQ557434

S. I. Lyashko, B. V. Rublev

Publication date: 30 June 2005

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:casa.0000020224.83374.d7

zbMATH Keywords

convex polyhedrongeometrical algorithmmaximum-volume simplexminimum-volume ellipsoid

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (3)

Computing efficiently the lattice width in any dimension ⋮ Multivariate ranking using elliptical peeling ⋮ Efficient Lattice Width Computation in Arbitrary Dimension

This page was built for publication: Minimal ellipsoids and maximal simplexes in 3D Euclidean space