DOLFIN
DOLFIN C++ interface
|
#include <ConvexTriangulation.h>
Static Public Member Functions | |
static std::vector< std::vector< Point > > | triangulate (const std::vector< Point > &p, std::size_t gdim, std::size_t tdim) |
Tdim independent wrapper. | |
static std::vector< std::vector< Point > > | triangulate_1d (const std::vector< Point > &pm, std::size_t gdim) |
Triangulate 1D. | |
static std::vector< std::vector< Point > > | triangulate_graham_scan_2d (const std::vector< Point > &pm) |
Triangulate using the Graham scan 2D. | |
static std::vector< std::vector< Point > > | triangulate_graham_scan_3d (const std::vector< Point > &pm) |
Triangulate using the Graham scan 3D. | |
static bool | selfintersects (const std::vector< std::vector< Point >> &p) |
Determine if there are self-intersecting tetrahedra. | |
This class implements algorithms for triangulating convex domains represented as a set of points.