Investigation of the efficiency of the moving least squares method in the reconstruction of a three-dimensional surface on a supercomputer
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916083376586752 |
|---|---|
| author | Khabibulin, Marat Ildarovich |
| author_facet | Khabibulin, Marat Ildarovich |
| contents | Currently, the area of geometric modeling and the construction of 3D models based on point clouds from laser sensors is actively developing. One of the basic tasks of geometric modeling is the reconstruction of a surface from a cloud of points. The aim of this work is to develop a parallel least-squares surface reconstruction method on a distributed memory supercomputer that allows achieving optimal results both in scalability and surface reconstruction quality. The focus of the work is on the surface reconstruction algorithm based on the least squares method, in connection with which the algorithm was called the moving least squares method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03365 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Investigation of the efficiency of the moving least squares method in the reconstruction of a three-dimensional surface on a supercomputer Khabibulin, Marat Ildarovich Distributed, Parallel, and Cluster Computing Currently, the area of geometric modeling and the construction of 3D models based on point clouds from laser sensors is actively developing. One of the basic tasks of geometric modeling is the reconstruction of a surface from a cloud of points. The aim of this work is to develop a parallel least-squares surface reconstruction method on a distributed memory supercomputer that allows achieving optimal results both in scalability and surface reconstruction quality. The focus of the work is on the surface reconstruction algorithm based on the least squares method, in connection with which the algorithm was called the moving least squares method. |
| title | Investigation of the efficiency of the moving least squares method in the reconstruction of a three-dimensional surface on a supercomputer |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2401.03365 |