Discrete algorithm for tetrahedral mesh considering feature constraint

Abstract

The invention relates to a discrete algorithm for a tetrahedral mesh considering feature constraint. The algorithm comprises the steps of: before dividing the mesh, performing feature constraint treatment firstly, considering the constrain face in the object as inner hole constraint with zero thickness, discretizing the constrain face by treatment method similar to hole constraint intotwo groups of triangular front edges overlapped in location but opposite in normal, and discretizing the constrain line to a plurality of sections according to the size control function, then generating the tetrahedronal unit by gradual propelling in the object based on the triangular front edges till the front edge arrays of the current and next layers are empty completely; dynamically maintaining the front edge arrays of the current and next layers when the front edges propel, and controlling the size of the tetrahedronal unit by using an area-independent method to generate the uniform mesh unit; adjusting the mesh topologies on both sides of the constrain face after discretizing the mesh, and finally carrying out topological optimization of mesh and Laplace geometry optimization.

Description

technical field [0001] The present invention relates to the fields of computer graphics, computational geometry, CAD / CAE, GIS, mathematical geology, finite element calculation, etc., and its purpose is to use triangular meshes to express the three-dimensional object surface model under the consideration of various internal constraints. Divided into tetrahedral units with no overlap, no holes and approximately equal size, close to regular tetrahedrons. Specifically, it involves feature constraint processing, grid element size control, frontier advancing grid generation, grid topology optimization and geometry optimization, etc. Background technique [0002] In recent years, scholars at home and abroad have done a lot of research on finite element grid discretization methods, and proposed effective grid discretization methods such as Delaunay method, grid method (finite quad / octree method), and advancing wavefront method. Among them, the mathematical theory of the Delaunay me...

AI Technical Summary

Problems solved by technology

[0006] The present invention aims to solve the problem of tetrahedral grid discretization considering feature constraints. The previous feature constraint processing mostly adopts the strategy of first discretizing the grid and then performing constraint processing. When the boundary is complex and there are many feature lines and feature surfaces, it takes It takes more time to process feature constraints such as edge restoration and surface restoration, which reduces the efficiency of mesh discretization and tends to produce units with poor quality

Images