The following pages link to Finding minimal enclosing boxes (Q3704926):
Displaying 23 items.
- Isoperimetric triangular enclosures with a fixed angle (Q375380) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Cutting a convex polyhedron out of a sphere (Q659695) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← links)
- How to get close to the median shape (Q870425) (← links)
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- A polynomial solution for the Potato-peeling problem (Q1076347) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Minimal enclosing parallelepiped in 3D (Q1886236) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
- On the reverse dual Loomis-Whitney inequality (Q2311952) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems (Q2708040) (← links)
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions (Q2709794) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← links)
- (Q5021002) (← links)
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS (Q5291406) (← links)
- Optimal Embedded and Enclosing Isosceles Triangles (Q6066459) (← links)
- Affine linear parameter-varying embedding of non-linear models with improved accuracy and minimal overbounding (Q6611579) (← links)
