This class implements Delaunay triangulation functions.
More...
#include <Delaunay.h>
This class implements Delaunay triangulation functions.
◆ CircumCricleIndexTriangleList
Definition of a list holding extended index triangles.
◆ CircumCricleIndexTriangles
Definition of a vector holding extended index triangles.
◆ EdgeMap
Definition of a map mapping edge pairs to a counter.
◆ IndexTriangles
Definition of a vector holding index triangles.
◆ checkTriangulation() [1/2]
Checks a Delaunay triangulation for integrity: no points are allowed within the circumcircle of a triangle.
- Parameters
-
triangles | Delaunay triangulation |
points | Vector with points coordinates |
epsilon | The epsilon value used for a slightly more generous comparison, with range [0, infinity) |
- Returns
- True, if the provided triangulation is a valid Delaunay triangulation
◆ checkTriangulation() [2/2]
Checks a Delaunay triangulation for integrity: no points are allowed within the circumcircle of a triangle.
- Parameters
-
triangles | Delaunay triangulation |
points | Vector with points coordinates |
epsilon | The epsilon value used for a slightly more generous comparison, with range [0, infinity) |
- Returns
- True, if the provided triangulation is a valid Delaunay triangulation
◆ triangulation()
Determines the delaunay triangulation for a given 2D point set.
The implementation is based on the Bowyer-Watson algorithm.
- Parameters
-
points | 2D point set to be triangulated, at least three |
- Returns
- Resulting triangulation
The documentation for this class was generated from the following file: