Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Recurso digital |
| Язык: | русский |
| Опубликовано: |
Zenodo
2023
|
| Online-ссылка: | https://doi.org/10.5281/zenodo.8064031 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Оглавление:
- <p>In this paper, we consider the problem of finding an element of a collection of polygonal models that is closest to a given object using parallel computing. Options for parallelizing the solution to this problem are proposed, with static and dynamic load balancing, which made it possible to significantly speed up the search process. The developed algorithm was implemented in the Python programming language using the MPI for Python library, which supports parallel computing, and tested on a collection of several thousand models on a local machine and on the IBM Polus high-performance computing system. The results of computational experiments have shown that the developed algorithm significantly outperforms the sequential search for the closest object in terms of computation speed. The algorithm proposed in this paper can be used in various fields, such as computer graphics, computer vision, robotics, and others.</p>