Computationally efficient barycentric interpolation of large grain boundary octonion point sets.
Grain boundary
Hypersphere
Octonion
Triangulation
Journal
MethodsX
ISSN: 2215-0161
Titre abrégé: MethodsX
Pays: Netherlands
ID NLM: 101639829
Informations de publication
Date de publication:
2022
2022
Historique:
received:
29
07
2021
accepted:
09
05
2022
entrez:
6
6
2022
pubmed:
7
6
2022
medline:
7
6
2022
Statut:
epublish
Résumé
We present a method for performing efficient barycentric interpolation for large grain boundary octonion point sets which reside on the surface of a hypersphere. This method includes removal of degenerate dimensions via singular value decomposition (SVD) transformations and linear projections, determination of intersecting facets via nearest neighbor (NN) searches, and interpolation. This method is useful for hyperspherical point sets for applications such as grain boundaries structure-property models, robotics, and specialized neural networks. We provide a case study of the method applied to the 7-sphere. We provide 1-sphere and 2-sphere visualizations to illustrate important aspects of these dimension reduction and interpolation methods. A MATLAB implementation is available at github.com/sgbaird-5dof/interp.•Barycentric interpolation is combined with hypersphere facet intersections, dimensionality reduction, and linear projections to reduce computational complexity without loss of information•A max nearest neighbor threshold is used in conjunction with facet intersection determination to reduce computational runtime.
Identifiants
pubmed: 35664040
doi: 10.1016/j.mex.2022.101731
pii: S2215-0161(22)00112-1
pmc: PMC9160837
doi:
Types de publication
Journal Article
Langues
eng
Pagination
101731Informations de copyright
© 2022 The Author(s).
Déclaration de conflit d'intérêts
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.