Готові списки джерел за темами / Packing of parallelepipeds

Добірка наукової літератури з теми "Packing of parallelepipeds"

Автор: Grafiati
Опубліковано: 30 травня 2022
Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Packing of parallelepipeds".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Packing of parallelepipeds"

1

Grebennik, I. V., A. V. Pankratov, A. M. Chugay, and A. V. Baranov. "Packing n-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an n-dimensional parallelepiped." Cybernetics and Systems Analysis 46, no. 5 (September 2010): 793–802. http://dx.doi.org/10.1007/s10559-010-9260-8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Anikeyev, S. G. "GEODYNAMICS." GEODYNAMICS 2(11)2011, no. 2(11) (September 20, 2011): 18–20. http://dx.doi.org/10.23939/jgd2011.02.018.

Повний текст джерела
Анотація:
Submitted by fast way to solve the direct problem of 2D/3D gravimetric and magnetic prospecting for complex geological models. Approximating design of models is very dense packing of large numbers of small homogeneous parallelepipeds (108 and over). The method of approximation corresponds to the formulation of linear problems. The developed algorithm can be used to quickly calculate the potential and its derivatives.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Stoyan, Yu, and A. Chugay. "Packing cylinders and rectangular parallelepipeds with distances between them into a given region." European Journal of Operational Research 197, no. 2 (September 2009): 446–55. http://dx.doi.org/10.1016/j.ejor.2008.07.003.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Pshenichnyi, B. N., and L. A. Sobolenko. "Inverse convex programming and parallelepiped packing." Cybernetics and Systems Analysis 32, no. 3 (May 1996): 319–28. http://dx.doi.org/10.1007/bf02366493.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Yanqui, Calixtro. "An average model for disordered sphere packings." EPJ Web of Conferences 249 (2021): 02004. http://dx.doi.org/10.1051/epjconf/202124902004.

Повний текст джерела
Анотація:
In this paper, an assembly of disordered packings is considered as a suitable set of packing cells of ordered spheres. In consequence, any of its parameters can be obtained by averaging the values of the set. Namely, the density of a packing of ordered spheres is described by two variables: the angle of the base, and the angle of the inclined edge of the associated parallelepiped. Then, the density of a packing of disordered spheres is obtained by averaging the angle of the base, and the subsequent averaging of the other angle, according to the kind of strain induced by the experiment. The average packing yields the density limits of loose sphere assemblies achieved by a process of fluidization and sedimentation in air, in water, and in viscous liquid at zero gravitational force. It also models the close sphere assemblies shaped by gentle tapping, vertical shaking, horizontal and multidirectional vibrations. The theory allows to elucidate the mechanism of each of the limits, as, for example, the metastable columns of spheres in the loosest packing, as well as the random close packing, and crystallization. The limits obtained coincide very well with the published experimental, numerical and theoretical data.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Stoyan, Y. G., N. I. Gil, G. Scheithauer, A. Pankratov, and I. Magdalina. "Packing of convex polytopes into a parallelepiped." Optimization 54, no. 2 (April 2005): 215–35. http://dx.doi.org/10.1080/02331930500050681.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Pyryev, Yuriy, Tomasz Zwierzyński, Edmundas Kibirkštis, Laura Gegeckienė, and Kęstutis Vaitasius. "Model to predict the top-to-bottom compressive strength of folding cartons." Nordic Pulp & Paper Research Journal 34, no. 1 (March 26, 2019): 117–27. http://dx.doi.org/10.1515/npprj-2018-0032.

Повний текст джерела
Анотація:
AbstractThis paper presents a proposed mathematical model, describing the calculations involved in deducting the critical compression force for rectangular, parallelepiped paperboard packaging, and permitting the minimisation of the thickness of the package sidewall. A comparison is given between the obtained calculations regarding critical force and the experimentally-determined results. This has shown a sufficient level of accuracy both for the theoretical and the experimental results. This means that the proposed mathematical engineering calculations model can be applied to the design of rectangular, parallelepiped paperboard packaging.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Verkhoturov, Mikhail, Alexander Petunin, Galina Verkhoturova, Konstantin Danilov, and Dmitry Kurennov. "The 3D Object Packing Problem into a Parallelepiped Container Based on Discrete-Logical Representation." IFAC-PapersOnLine 49, no. 12 (2016): 1–5. http://dx.doi.org/10.1016/j.ifacol.2016.07.540.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Packing of parallelepipeds"

1

Grebennik, I., O. Lytvynenko, O. Baranov, and R. Dupas. "Three-dimensional one-to-one pickup and delivery routing problem with loading constraints." Thesis, 2016. http://openarchive.nure.ua/handle/document/3806.

Повний текст джерела
Анотація:
We propose mathematical model and solving strategy for PDP with 3D loading constraints in terms of combinatorial configuration instead of traditional approach that uses boolean variables. We solve traditional one-to-one Pickup and Delivery Problem in combination with problem of packing delivered items into vehicles by means of proposed combinatorial generation algorithm.
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Packing of parallelepipeds"

1

Chekanin, Vladislav, and Alexander Chekanin. "Algorithms for Working with Orthogonal Polyhedrons in Solving Cutting and Packing Problems." In 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-3027-656-665.

Повний текст джерела
Анотація:
In this paper problems of cutting and packing objects of complex geometric shapes are considered. To solve these NP-hard problems, it is proposed to use an approach based on geometric transformation of polygonal objects to composite objects (orthogonal polyhedrons) made up of rectangles or parallelepipeds of a given dimension. To describe the free space inside a voxelized container, a model of potential containers is used as the basic model that provides the ability of packing orthogonal polyhedrons. A number of specialized algorithms are developed to work with orthogonal polyhedrons including: algorithms for placing and removing composite objects, an algorithm for forming a packing with a given distance between objects to be placed. Two algorithms for the placement of orthogonal polyhedrons are developed and their efficiency is investigated. An algorithm for obtaining a container of complex shape presented as an orthogonal polyhedron based on a polygonal model is given. The article contains examples of placement schemes obtained by the developed algorithms for solving problems of packing two-dimensional and three-dimensional non-rectangular composite objects.
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії