Domain Triangulation between Convex Polytopes
Vasyl Tereshchenko, С. В. Пилипенко, Andriy Fisunenko · Procedia Computer Science · 2013
In this paper, we propose a method for solving the problem triangulation of a domain between convex polyhedrons in d- dimensional space using Delaunay triangulation in O(N2) time. Novelty of our work is in using a modified Delaunay triangulation algorithm with constraints.