Algorithm of the Delaunay Triangulation Net Interpolated Feature Points for Borehole Data

When interpolating feature points into constructed triangulated irregular network, it will give rise to reconstruction of the original triangulation. This requires finding out the interpolated point´s positions and partial adjustment of triangulation where the points inserted. These operations need a large amount of computing. In this paper, we will discuss how to determine the insertion point´s locations, improve triangulation reconstruction´s speed, and gave a mid-point algorithm to avoid positioning internal interpolation points, and do direct internal reconstruction of the triangle in order to fast interpolation quality refinement of Delaunay triangulation based on the existing triangulation irregular network.