Sparse balanced layout of ellipsoids

DOI10.1007/s10559-021-00412-3zbMath1486.90167OpenAlexW3215315472MaRDI QIDQ2668514

Petro I. Stetsyuk, O. V. Pankratov, S. V. Maximov, Tatiana E. Romanova, Yu. G. Stoyan

Publication date: 7 March 2022

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-021-00412-3

zbMATH Keywords

nonlinear programmingShor's \(r\)-algorithmsparse layoutellipsoid of revolution (spheroid)quasi-phi-function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (3)

The concept of modeling packing and covering problems using modern computational geometry software ⋮ Digital model of natural cores using geometric design ⋮ Lattice coverage of cuboid with minimum number of hemispheres

Cites Work

• Quasi-phi-functions and optimal packing of ellipses
• Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving
• Packing ellipsoids by nonlinear optimization
• Packing ellipsoids into volume-minimizing rectangular boxes
• Theory and software implementations of Shor's \(r\)-algorithms
• Combinatorial configurations in balance layout optimization problems
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Shor's \(r\)-algorithms: theory and practice
• Optimized packing multidimensional hyperspheres: a unified approach
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• Sparse balanced layout of spherical voids in three-dimensional domains
• Parallel computing technologies for solving optimization problems of geometric design
• Packing ellipsoids in an optimized cylinder

This page was built for publication: Sparse balanced layout of ellipsoids