Regularization Method for Discrete Mesh Points

A regularization method for discrete mesh points based on binary tree structure is presented to solve the link chaos between mesh points in the structured sorting of the interface mesh. Firstly, the idea of the present regularization method is introduced in detail. The present method is based on the one-to-one mapping relationship between the binary tree structure and the structured mesh data and reconstructs the row and column information as well as obtains the structured sorting of mesh points by creating the binary tree model of the mesh data. Then, the detailed procedure of regularizing the binary tree model is described, including mesh point classification, root node creation, child nodes addition and so on. Finally, the binary tree model is traversed layer by layer to obtain the sorted structured mesh points. The numerical experimental results on mesh data with different configurations, sizes and ranks show that the present regularization method has good adaptability and high robustness. Moreover, the method also indicates excellent efficiency in the structured sorting of interface mesh used in industrial cases.