Polynomial time algorithms for maximizing the intersection volume of polytopes

MaRDI QIDQ5442483zbMATH OpenFDO

Authors Komei Fukuda, Takeaki Uno

Publication date 22 February 2008

zbMATH Keywords

ellipsoid methodintersection maximization problemintersection volume of polytopespolynomial time algorithms

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Maximum overlap of convex polytopes under translation
• Overlap of convex polytopes under rigid motion
• Maximum overlap of convex polytopes under translation
• Translational packing of arbitrary polytopes
• Maximum overlap and minimum convex hull of two convex polyhedra under translations

Cited in

(4)

• Volume maximization and orthoconvex approximation of orthogons
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing

This page was built for publication: Polynomial time algorithms for maximizing the intersection volume of polytopes

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