Abstract: In this paper, an algorithm for constructing a Delaunay triangulation of the point set in an arbitrarily shaped, multiply-connected 3D domain is presented. The algorithm has the properties identical to those of the standard Delaunay triangulation, preserves the boundary of the given region and can be used for the nonconvex regions or the region with holes. No limitation is imposed on the location of 3D points.