scientific article; zbMATH DE number 1445342
From MaRDI portal
Publication:4952659
Recommendations
- Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
- On the minimal volume of simplices enclosing a convex body
- Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
- Computing minimum-volume enclosing ellipsoids
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- scientific article; zbMATH DE number 1305395
- Minimum-volume ellipsoids. Theory and algorithms
- Approximation for minimum triangulations of simplicial convex 3-polytopes
- Simplicial algorithms for minimizing polyhedral functions
Cited in
(10)- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- On the minimum volume simplex enclosure problem for estimating a linear mixing model
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
- scientific article; zbMATH DE number 1305395 (Why is no real title available?)
- scientific article; zbMATH DE number 2169110 (Why is no real title available?)
- scientific article; zbMATH DE number 1885207 (Why is no real title available?)
- Toward quantifying vertex similarity in networks
- Algorithm for finding minimum volume oriented bounding boxes based on convex hull
- Optimal bounding cones of vectors in three dimensions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952659)
