Quaternion-based formulations for volume maximisation problems

DOI10.1007/S10878-025-01351-XMaRDI QIDQ6912358zbMATH OpenFDO

Authors Jonas Tollenaere, T. Wauters

Publication date 22 October 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01351-X

zbMATH Keywords

cutting and packingquadratically constrained programmingquaternionsvolume maximisation problems

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Quadratic programming (90C20) Combinatorial optimization (90C27)

Cites work

• Extracting maximal objects from three-dimensional solid materials
• Irregular packing problems: a review of mathematical models
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Quasi-phi-functions and optimal packing of ellipses
• Quaternions for computer graphics
• Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem

Cited in

(1)

• The latest developments in combinatorial optimization

This page was built for publication: Quaternion-based formulations for volume maximisation problems

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