Delaunay triangulation

资 源 简 介

Delaunay triangulation is one of the most well known algorithms for space tesselation. Dynamic Delaunay triangulation， in which you can update the input points using a predefined matrice for saving points， is presented in this document.

详 情 说 明

Delaunay triangulation is a widely used algorithm for space tesselation. It is used in a variety of fields, ranging from computer graphics to physics simulations. In this document, we present the concept of Dynamic Delaunay triangulation, which allows you to update the input points using a predefined matrice for saving points. This can be particularly useful in scenarios where new points are added or removed frequently. Additionally, it is worth noting that Delaunay triangulation has a number of interesting mathematical properties, such as the fact that the circumcircle of any triangle in the triangulation contains no other points in its interior. This makes it a powerful tool in many different applications.