2021
DOI: 10.3390/math9192424
|View full text |Cite
|
Sign up to set email alerts
|

A Dimension Splitting-Interpolating Moving Least Squares (DS-IMLS) Method with Nonsingular Weight Functions

Abstract: By introducing the dimension splitting method (DSM) into the improved interpolating moving least-squares (IMLS) method with nonsingular weight function, a dimension splitting–interpolating moving least squares (DS–IMLS) method is first proposed. Since the DSM can decompose the problem into a series of lower-dimensional problems, the DS–IMLS method can reduce the matrix dimension in calculating the shape function and reduce the computational complexity of the derivatives of the approximation function. The appro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 63 publications
0
4
0
Order By: Relevance
“…Firstly, in order to enquire more useful point cloud information, the up-sampling algorithm was applied to increase the point clouds density ( Figure 3 d), in which each grain point was sampled with uniform random distribution to maintain a constant point density. Secondly, since the difference between filled/unfilled rice grains was the curvature of the cavity in the belly of the grain, the normal vector was acquired based on the MLS method ( Figure 3 e) [ 27 ], which was an important feature for filled/unfilled rice grain identification. And the principle of MLS method to calculate a normal vector was as follows: finding any point { } in a certain field; obtaining a plane α: , in which the sum of the squares of the distances from to the plane was minimized by the Formula (3).…”
Section: Methodsmentioning
confidence: 99%
“…Firstly, in order to enquire more useful point cloud information, the up-sampling algorithm was applied to increase the point clouds density ( Figure 3 d), in which each grain point was sampled with uniform random distribution to maintain a constant point density. Secondly, since the difference between filled/unfilled rice grains was the curvature of the cavity in the belly of the grain, the normal vector was acquired based on the MLS method ( Figure 3 e) [ 27 ], which was an important feature for filled/unfilled rice grain identification. And the principle of MLS method to calculate a normal vector was as follows: finding any point { } in a certain field; obtaining a plane α: , in which the sum of the squares of the distances from to the plane was minimized by the Formula (3).…”
Section: Methodsmentioning
confidence: 99%
“…This method first combines the target shape, then divides it into eight equal parts and performs convolutional neural network extraction of voxel features within each octant; based on O-CNN, adaptive O-CNN [14] proposed a planar fitting method for three-dimensional surfaces, in addition to using the pre-set depth of the octree and whether the number of point clouds within the octree reaches a threshold as the partition conditions for the octree, and using the ability to fit the current shape within the octree as an additional partition condition; based on O-CNN, DeepMLS proposed to perform convolutional neural network feature extraction in each smallest octant, and output MLS point cloud through MLP. The moving least-square function is used to approximate the signed distance function, which is used as an implicit function to extract three-dimensional surfaces; dual graph neural networks (GNN) [15] utilized graph convolution to combine voxel features of different scales and transmit octahedral feature information of different depths; Neural-IMLS [16] proposed different weight functions based on DeepMLS and learns SDF directly from the original point cloud in a self-supervised manner. Towards implicit text-guided 3D-shape generation (TISG) [17] generated 3D shapes from text based on an octree; dynamic code cloud-deep implicit functions (DCC-DIF) [18] discretized the space into regular 3D meshes (or octree) and store local codes in grid points (or octant nodes) to calculate local features by interpolating their adjacent local codes and their positions.…”
Section: Related Workmentioning
confidence: 99%
“…To improve the computational efficiency of the EFG method, by introducing the dimension splitting method [43], Cheng et al proposed the dimension splitting element-free Galerkin (DS-EFG) method [44] and dimension splitting interpolating element-free Galerkin (DS-IEFG) method [45]. The dimension splitting meshless method greatly improves the computational efficiency of the EFG method, and shows high computational efficiency and accuracy for 3D advection-diffusion problems [46], 3D transient heat conduction problems [47][48][49], 3D elasticity problems [50], 3D wave equations [51,52], etc.…”
Section: Introductionmentioning
confidence: 99%