21 #ifndef __CONVEX_TRIANGULATION 22 #define __CONVEX_TRIANGULATION 38 static std::vector<std::vector<Point>>
44 static std::vector<std::vector<Point>>
48 return _triangulate_1d(pm, gdim);
52 static std::vector<std::vector<Point>>
55 return _triangulate_graham_scan_2d(pm);
59 static std::vector<std::vector<Point>>
63 static bool selfintersects(
const std::vector<std::vector<Point>>& p);
70 static std::vector<std::vector<Point>>
71 _triangulate_1d(
const std::vector<Point>& pm,
75 static std::vector<std::vector<Point>>
76 _triangulate_graham_scan_2d(
const std::vector<Point>& pm);
79 static std::vector<std::vector<Point>>
80 _triangulate_graham_scan_3d(
const std::vector<Point>& pm);
static std::vector< std::vector< Point > > triangulate(const std::vector< Point > &p, std::size_t gdim, std::size_t tdim)
Tdim independent wrapper.
Definition: ConvexTriangulation.cpp:177
static bool selfintersects(const std::vector< std::vector< Point >> &p)
Determine if there are self-intersecting tetrahedra.
Definition: ConvexTriangulation.cpp:575
static std::vector< std::vector< Point > > triangulate_graham_scan_3d(const std::vector< Point > &pm)
Triangulate using the Graham scan 3D.
Definition: ConvexTriangulation.cpp:534
static std::vector< std::vector< Point > > triangulate_1d(const std::vector< Point > &pm, std::size_t gdim)
Triangulate 1D.
Definition: ConvexTriangulation.h:45
static std::vector< std::vector< Point > > triangulate_graham_scan_2d(const std::vector< Point > &pm)
Triangulate using the Graham scan 2D.
Definition: ConvexTriangulation.h:53
Definition: ConvexTriangulation.h:33