Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
From MaRDI portal
Publication:3149870
DOI10.1137/S0097539799363992zbMath1041.68052OpenAlexW2035541108MaRDI QIDQ3149870
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
Analysis of algorithms and problem complexity (68Q25) Three-dimensional polytopes (52B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Minimal enclosing parallelepiped in 3D, On the minimum volume simplex enclosure problem for estimating a linear mixing model, How to get close to the median shape, Isoperimetric triangular enclosures with a fixed angle, Multipolar robust optimization, Practical methods for shape fitting and kinetic data structures using coresets, Approximation of convex sets by polytopes
