A New Generation Tetrahedron Mesh Technique of Complex Mining Geological Bodies

Complex structure, non-homogeneity, anisotropy and multiple constraint conditions are typical characters of 3D data modeling of geo-science and mining. It is a key problem for algorithm of generating tetrahedrons to ensure that every simple geological body's boundary is conformance. To resolve this problem, a fast divide conquer algorithm is proposed to efficiency generate Delaunay tetrahedron mesh from a given point set. Firstly, to separate a geo-science model into one or many simple geological bodies whose boundaries then are intersected into Delaunay triangles. Secondly,for every geological body, starting with a seed boundary triangle, the algorithm grows recursively tetrahedron meshes of every geological body by selecting a suit point from given point cloud. Finally, all tetrahedron meshes of every geological body are joined together. In this algorithm the boundary conference is ensured, overlapped tetrahedrons are avoided, and most generated tetrahedrons are Delaunay.