Feel++
0.92.0
|
Good interpolation point sets on a convex. More...
#include <pointsetinterpolation.hpp>
Typedefs | |
typedef super::return_type | return_type |
typedef T | value_type |
typedef Convex< Dim, Order, Dim > | convex_type |
typedef super::nodes_type | nodes_type |
typedef matrix_node < value_type >::type | points_type |
typedef mpl::if_< mpl::bool_ < is_simplex >, Simplex< Dim, Order, Dim >, Hypercube< Dim, Order, Dim > > | conv_order_type |
typedef Reference< convex_type, Dim, convexOrder, Dim, value_type > | RefElem |
typedef std::pair< uint16_type, uint16_type > | range_type |
typedef std::vector < std::vector< size_type > > | index_map_type |
static const bool | is_simplex = convex_type::is_simplex |
static const bool | is_hypercube = convex_type::is_hypercube |
static const uint32_type | convexOrder = convex_type::nOrder |
static const uint32_type | topological_dimension = convex_type::topological_dimension |
static const uint32_type | numPoints = conv_order_type::type::numPoints |
static const uint32_type | nbPtsPerVertex = conv_order_type::type::nbPtsPerVertex |
static const uint32_type | nbPtsPerEdge = conv_order_type::type::nbPtsPerEdge |
static const uint32_type | nbPtsPerFace = conv_order_type::type::nbPtsPerFace |
static const uint32_type | nbPtsPerVolume = conv_order_type::type::nbPtsPerVolume |
RefElem | RefConv |
Constructors, destructor | |
PointSetInterpolation () | |
PointSetInterpolation (size_type np) | |
PointSetInterpolation (PointSetInterpolation &psi) | |
~PointSetInterpolation () | |
ublas::matrix_range < nodes_type const > | pointsByEntity (uint16_type e) const |
range_type | interiorRangeById (uint16_type e, uint16_type id) const |
ublas::matrix_range < nodes_type const > | interiorPointsById (uint16_type e, uint16_type id) const |
uint32_type | entityIds (int i, int j) const |
uint32_type | numEntities (int i) const |
range_type const & | pointToEntity (int p) const |
index_map_type | entityToLocal (uint16_type top_dim, uint16_type local_id, bool boundary=0) |
points_type | pointsBySubEntity (uint16_type top_dim, uint16_type local_id, bool boundary=0) |
index_map_type | getEid () |
std::vector< range_type > | getPtE () |
void | setEid (index_map_type eid) |
void | setPtE (std::vector< range_type > pt_ent) |
void | addToEid (uint16_type p, uint16_type q) |
void | addToPtE (uint16_type p, range_type q) |
FEELPP_DEFINE_VISITABLE () |
Good interpolation point sets on a convex.