Feel++
0.91.4
|
transform a point set to a mesh data structure using a Delaunay More...
#include <pointsettomesh.hpp>
Public Types | |
Typedefs | |
typedef T | value_type |
typedef Convex | convex_type |
typedef convex_type::template shape< convex_type::nDim, 1, convex_type::nDim >::type | mesh_convex_type |
typedef PointSet< convex_type, value_type > | pointset_type |
typedef Mesh< mesh_convex_type > | mesh_type |
typedef boost::shared_ptr < mesh_type > | mesh_ptrtype |
typedef matrix_node < value_type >::type | points_type |
typedef mesh_type::point_type | point_type |
typedef point_type::node_type | node_type |
typedef mesh_type::edge_type | edge_type |
typedef mesh_type::face_type | face_type |
typedef mesh_type::element_type | element_type |
Public Member Functions | |
Constructors, destructor | |
PointSetToMesh () | |
PointSetToMesh (PointSetToMesh const &p) | |
~PointSetToMesh () | |
Accessors | |
mesh_ptrtype | mesh () |
Mutators | |
void | addBoundaryPoints (points_type const &v) |
Methods | |
void | visit (pointset_type *pset) |
Static Public Attributes | |
Constants | |
static const uint16_type | nDim = Convex::nDim |
transform a point set to a mesh data structure using a Delaunay
the delaunay algorithm comes from Vtk
void Feel::PointSetToMesh< Convex, T >::visit | ( | pointset_type * | pset | ) | [inline] |
visit the point set pset
and transform it into a mesh data structure using Delaunay triangulation