Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions

DOI10.1137/S0097539799363992MaRDI QIDQ3149870zbMATH OpenOpenAlexFDO

Authors Yunhong Zhou, Subhash Suri

Publication date 29 September 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539799363992

zbMATH Keywords

bounding volumescentroidshape approximation

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1445342
• scientific article; zbMATH DE number 1305395
• Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
• Minimal enclosing parallelepiped in 3D
• Algorithms - ESA 2003

Cited in

(20)

• Practical methods for shape fitting and kinetic data structures using coresets
• A new algorithm for the minimal-area convex enclosure problem
• Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
• Multipolar robust optimization
• Minimal enclosing parallelepiped in 3D
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• On the minimum volume simplex enclosure problem for estimating a linear mixing model
• Approximation of convex sets by polytopes
• Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
• Finding minimal enclosing boxes
• Isoperimetric triangular enclosures with a fixed angle
• 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?)
• scientific article; zbMATH DE number 1445342 (Why is no real title available?)
• Algorithm for finding minimum volume oriented bounding boxes based on convex hull
• Finding simplices containing the origin in two and three dimensions
• Minimal ellipsoids and maximal simplexes in 3D Euclidean space
• Optimal bounding cones of vectors in three dimensions
• How to get close to the median shape

This page was built for publication: Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions

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