Minimal ellipsoids and maximal simplexes in 3D Euclidean space

DOI10.1023/B:CASA.0000020224.83374.D7zbMATH Open1097.52004OpenAlexW1967391761MaRDI QIDQ557434FDOQ557434

Authors: S. I. Lyashko, B. V. Rubl'ov 

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

Recommendations

• scientific article; zbMATH DE number 2169260
• scientific article; zbMATH DE number 221630
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• An algorithm for constructing of minimal volume ellipsoid
• scientific article; zbMATH DE number 4114428

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)

Cited In (13)

• ELLIPSOIDS ARE THE ONLY LOCAL MAXIMIZERS OF THE VOLUME PRODUCT
• Construction of the ellipsoid of minimal volume for elementary polyhedrons
• Minimal enclosing parallelepiped in 3D
• Title not available (Why is that?)
• Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
• Minimum Ellipsoids
• Numerical solution of extremal problems on constructing ellipsoids and parallelepipeds
• Multivariate ranking using elliptical peeling
• Title not available (Why is that?)
• Computing efficiently the lattice width in any dimension
• Grid and cloud computing for the modeling of the motion of a magnetized assymmetric body in an external magnetic field
• Title not available (Why is that?)
• Efficient lattice width computation in arbitrary dimension

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557434)