Dynamic Delaunay tetrahedralizations and Voronoi tessellations in three dimensions

We describe the implementation of an incremental insertion algorithm to construct and maintain three-dimensional Delaunay triangulations with dynamic vertices using a three-simplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tesselation. A given list of generators is triangulated and volumes as well as… CONTINUE READING