2025-02-23T00:13:30-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journalsuranuajme-article-46687%22&qt=morelikethis&rows=5
2025-02-23T00:13:30-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journalsuranuajme-article-46687%22&qt=morelikethis&rows=5
2025-02-23T00:13:30-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T00:13:30-05:00 DEBUG: Deserialized SOLR response

Optimal packing of convex polytopes using quasi-phi-functions

We study a packing problem of a given collection of convex polytopes into a rectangular container of minimal volume. Continuous rotations and translations of polytopes are allowed. In addition a given minimal allowable distances between polytopes are taking into account. We employ radical free quasi...

Full description

Saved in:
Bibliographic Details
Main Authors: Pankratov, A. V., Romanova, T. E., Chugay, A. M.
Format: Article
Language:English
Published: Journal of Mechanical Engineering 2015
Subjects:
Online Access:https://journals.uran.ua/jme/article/view/46687
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study a packing problem of a given collection of convex polytopes into a rectangular container of minimal volume. Continuous rotations and translations of polytopes are allowed. In addition a given minimal allowable distances between polytopes are taking into account. We employ radical free quasi-phi-functions and adjusted quasi-phi-functions to describe placement constraints. The use of quasi-phi-functions, instead of phi-functions, allows us to simplify non-overlapping, as well as, to describe distance constraints, but there is a price to pay: now the optimization has to be performed over a larger set of parameters, including the extra variables used by our new functions. We provide an exact mathematical model of the problem as a nonlinear programming problem. We also develop an efficient solution algorithm which involves a starting point algorithm, using homothetic trasformations of geometric objects and efficient local optimization procedure, which allows us to runtime and memory). We present here a number of examples to demonstrate the efficiency of our methodology.