49#ifndef INTREPID_CUBATURE_POLYGON_HPP
50#define INTREPID_CUBATURE_POLYGON_HPP
53#include "Teuchos_Assert.hpp"
54#include "Shards_CellTopology.hpp"
61 template<
class Scalar,
class ArrayPo
int=FieldContainer<Scalar>,
class ArrayWeight=ArrayPo
int>
72 const ArrayPoint& cellVertices,
82 ArrayWeight& cubWeights)
const;
92 ArrayWeight& cubWeights,
93 ArrayPoint& cellCoords)
const;
107 void getAccuracy(std::vector<int> & accuracy)
const;
Definition file for the Intrepid::CubaturePolygon class.
Header file for the Intrepid::Cubature class.
int getDimension() const
Returns dimension of integration domain.
shards::CellTopology cellTopology_
The topology of the polygon.
FieldContainer< Scalar > cubatureWeights_
Local copy of cubature weights.
void getAccuracy(std::vector< int > &accuracy) const
Returns max. degree of polynomials that are integrated exactly on each triangle. The return vector ha...
int cubDimension_
Dimension of integration domain.
ArrayPoint cellVertices_
The vertices of the polygon.
int getNumPoints() const
Returns the number of cubature points.
int numPoints_
The number of cubature points.
FieldContainer< Scalar > cubaturePoints_
Local copy of cubature points.
int degree_
The degree of the polynomials that are integrated exactly on each triangle.
void getCubature(ArrayPoint &cubPoints, ArrayWeight &cubWeights) const
Returns cubature points and weights (return arrays must be pre-sized/pre-allocated).
Defines the base class for cubature (integration) rules in Intrepid.
Implementation of a templated lexicographical container for a multi-indexed scalar quantity....