Automatic Patching Algorithm for Dirty Geometry Based on Cartesian Grid

Aiming to address the issue that dirty geometric models, such as slits and intersections, cannot be mesh-generated and require significant labor for repair, we propose a dirty geometric model repair algorithm based on a Cartesian grid. The core idea of this paper is to use the Cartesian mesh as the background mesh, leveraging its strong inclusiveness to the geometric model, and to process the dirty geometric model in chunks. This includes introducing the concept of surface reconstruction of the point cloud, identifying the cutting points between the mesh cell and the model object surface through intersection judgment, constructing the surface point cloud information of the geometric model, and computing the normal information of the point cloud. The surface of the geometric model is reconstructed using Poisson’s equation, resulting in a model characterized by watertight closure and good geometric surface properties, effectively repairing the dirty geometric model and ensuring its watertightness. An adaptive encrypted Cartesian mesh is used to extract the cutting points, enhancing automation compared to traditional methods, while the Poisson reconstruction method ensures the model’s closure. This approach demonstrates the method’s effectiveness and practicability by repairing various dirty geometrical areas, such as blade component joints and wing joints.