Abstract： Based on Delaunay algorithm，an algorithm is presented to fulfill the generation of tetrahedron mesh. The algorithm is effective for three-dimensional object of arbitrary shape，and it uses some data structures，such as array，chain and structure，to manage the nodes and the elements. Base grid is used to accelerate the generation of tetrahedron mesh. When a new node is added to the existing mesh，the bound face of the new node’s Delaunay cavum must be checked，to avoid the overlapping of tetrahedron elements. A method is brought forward to judge whether a node is inside an arbitrary closed area or not，and it can be used to generate the Delaunay mesh for concave object. Examples show that the algorithm is effective to approach to arbitrary coincide.
