An approach for computing the Delaunay Triangulation and the Voronoi Diagram in Ed

In this paper we propose a new approach to constructing the Delaunay Triangulationfor the case of multidimensional spaces $(d > 2)$. Analysing the modern state, it is possible to draw a conclusion, that the ideas for the existing effective algorithms developed for the case of $d ≤ 2$ are not simple to generalize on a multidimensional case, without the loss of efficiency. We offer for the solving this problem an effective algorithm that satisfies all the given requirements.