Photo from archive.org
Abstract 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… Click to show full abstract
Abstract 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.
Keywords:
space;
problem bounded;
non euclidean;
problem;
sphere packing;
packing problem
Journal Title: IFAC-PapersOnLine
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: IFAC-PapersOnLine
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!