|
HArD::Core2D
Hybrid Arbitrary Degree::Core 2D - Library to implement 2D schemes with edge and cell polynomials as unknowns
|
#include <vector>#include <algorithm>#include <fstream>#include <Eigen/Dense>#include <../Math/math.hpp>

Go to the source code of this file.
Classes | |
| class | Mesh2D::Polytope< object_dim > |
| A Vertex is a Polytope with object_dim = 0. More... | |
Namespaces | |
| namespace | Mesh2D |
Macros | |
| #define | _POLYTOPE2D_HPP |
Typedefs | |
| using | Mesh2D::VectorRd = Eigen::Matrix< double, DIMENSION, 1 > |
| using | Mesh2D::VectorZd = Eigen::Matrix< int, DIMENSION, 1 > |
| template<size_t object_dim> | |
| using | Mesh2D::Simplex = std::array< VectorRd, object_dim+1 > |
| template<size_t object_dim> | |
| using | Mesh2D::Simplices = std::vector< Simplex< object_dim > > |
| Method to find the center mass of an arbitrary simplex in arbitrary space. | |
| using | Mesh2D::Vertex = Polytope< 0 > |
| An Edge is a Polytope with object_dim = 1. | |
| using | Mesh2D::Edge = Polytope< 1 > |
| A Face is a Polytope with object_dim = DIMENSION - 1. | |
| using | Mesh2D::Face = Polytope< DIMENSION - 1 > |
| A Cell is a Polytope with object_dim = DIMENSION. | |
| using | Mesh2D::Cell = Polytope< DIMENSION > |
Functions | |
| template<size_t object_dim> | |
| VectorRd | Mesh2D::simplex_center_mass (Simplex< object_dim > simplex) |
| Method to find the Lebesgue measure of an arbitrary simplex in arbitrary space. | |
| template<size_t object_dim> | |
| double | Mesh2D::simplex_measure (Simplex< object_dim > simplex) |
Variables | |
| constexpr int | Mesh2D::DIMENSION = 2 |
| #define _POLYTOPE2D_HPP |