On the Algorithm for Equal Balls Packing into a Multi-connected Set
- 10.2991/iwci-19.2019.38How to use a DOI?
- densest packing of balls; optical-geometric approach; billiard simulation; three-dimensional space; non-Euclidean space
The paper is devoted to the problem of densest packing a given number of equal balls into multi-connected containers. The objective is to find the maximum radius associated with balls. We consider the problem both in three-dimensional Euclidean and one class of non-Euclidean spaces. In this study, the distance between points means the minimum time required to overcome the path between them. The algorithm based on the optical-geometric approach and billiard simulation combination is suggested and implemented. The idea is the following: we initially construct sufficiently small balls and enlarge them step by step as long as all the balls keep inside without overlaps. Computational experiments show the applicability and validity of the method.
- © 2019, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Alexander Kazakov AU - Anna Lempert AU - Tchung Thanh Ta PY - 2019/09 DA - 2019/09 TI - On the Algorithm for Equal Balls Packing into a Multi-connected Set BT - Proceedings of the VIth International Workshop 'Critical Infrastructures: Contingency Management, Intelligent, Agent-Based, Cloud Computing and Cyber Security' (IWCI 2019) PB - Atlantis Press SP - 216 EP - 222 SN - 1951-6851 UR - https://doi.org/10.2991/iwci-19.2019.38 DO - 10.2991/iwci-19.2019.38 ID - Kazakov2019/09 ER -