The sphere packing problem into bounded containers in three-dimension non-Euclidean space

This paper deals with the problem of optimal packing a given number of equal spheres into different closed sets. We consider the problem both in three-dimensional Euclidean and non-Euclidean spaces. The special algorithm based on optical-geometric approach is suggested and implemented. This approach...

Full description

Saved in:
Bibliographic Details
Published in:IFAC-PapersOnLine 2018, Vol.51 (32), p.782-787
Main Authors: Kazakov, A.L., Lempert, A.A., Ta, T.T.
Format: Article
Language:English
Subjects:
computational experiment
non-Euclidean space
numerical method
optical-geometric approach
optimal packing of spheres
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with the problem of optimal packing a given number of equal spheres into different closed sets. We consider the problem both in three-dimensional Euclidean and non-Euclidean spaces. The special algorithm based on optical-geometric approach is suggested and implemented. This approach is previously used only for packing circles in two-dimensional space. Numerical results are presented and discussed.
ISSN:2405-8963
2405-8963
DOI:10.1016/j.ifacol.2018.11.450