Optimal layout of ellipses and its application for additive manufacturing

The paper studies a layout problem of variable number of ellipses with variable sizes placed into an arbitrary disconnected polygonal domain with maximum packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Tools for the mathematical modelling of placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) using the phi-function technique are introduced. The tools make it possible to formulate the layout problem in the form of MIP model that is equivalent to a sequence of nonlinear programming subproblems. We develop a new solution algorithm that involves the feasible starting point algorithm and optimisation procedure to search for efficient locally optimal solutions of the layout problem. This algorithm can be used in the design of parts for << support-free >> additive manufacturing, taking into account the conditions for its static/ dynamic strength. Results of the algorithm implementation for a topologically optimised flat part with the analysis of a stress state are provided.

Automated summary

The paper studies the layout problem of ellipses with variable sizes placed into an arbitrary disconnected polygonal domain with maximum packing factor. Mathematical modelling tools for placement constraints are introduced, and a new solution algorithm involving feasible starting point algorithm and optimization procedure is developed to search for locally optimal solutions. The algorithm can be used in the design of support-free additive manufacturing parts, with consideration for static/dynamic strength conditions.