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.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9160837PMC
http://dx.doi.org/10.1016/j.mex.2022.101731DOI Listing

Publication Analysis

Top Keywords

point sets
12
efficient barycentric
8
barycentric interpolation
8
interpolation large
8
large grain
8
grain boundary
8
boundary octonion
8
octonion point
8
linear projections
8
nearest neighbor
8

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!