Intrepid
Intrepid_CubaturePolygon.hpp
1// @HEADER
2// ************************************************************************
3//
4// Intrepid Package
5// Copyright (2007) Sandia Corporation
6//
7// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8// license for use of this work by or on behalf of the U.S. Government.
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// 3. Neither the name of the Corporation nor the names of the
22// contributors may be used to endorse or promote products derived from
23// this software without specific prior written permission.
24//
25// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36//
37// Questions? Contact Pavel Bochev (pbboche@sandia.gov)
38// Denis Ridzal (dridzal@sandia.gov), or
39// Kara Peterson (kjpeter@sandia.gov)
40//
41// ************************************************************************
42// @HEADER
43
49#ifndef INTREPID_CUBATURE_POLYGON_HPP
50#define INTREPID_CUBATURE_POLYGON_HPP
51
52#include "Intrepid_Cubature.hpp"
53#include "Teuchos_Assert.hpp"
54#include "Shards_CellTopology.hpp"
55
56namespace Intrepid{
57
61 template<class Scalar, class ArrayPoint=FieldContainer<Scalar>, class ArrayWeight=ArrayPoint>
62 class CubaturePolygon : public Intrepid::Cubature<Scalar,ArrayPoint,ArrayWeight>{
63 public:
64
71 CubaturePolygon(const shards::CellTopology& cellTopology,
72 const ArrayPoint& cellVertices,
73 int degree);
74
81 void getCubature(ArrayPoint& cubPoints,
82 ArrayWeight& cubWeights) const;
83
91 void getCubature(ArrayPoint& cubPoints,
92 ArrayWeight& cubWeights,
93 ArrayPoint& cellCoords) const;
94
95
98 int getNumPoints() const;
99
102 int getDimension() const;
103
107 void getAccuracy(std::vector<int> & accuracy) const;
108
109
110 virtual ~CubaturePolygon() {}
111
112 private:
113
114
117 shards::CellTopology cellTopology_;
118
121 ArrayPoint cellVertices_;
122
126
129 FieldContainer<Scalar> cubaturePoints_;
130
133 FieldContainer<Scalar> cubatureWeights_;
134
138
142
143 }; // end class CubaturePolygon
144
145} // end namespace Intrepid
146
148
149#endif
150
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.
CubaturePolygon(const shards::CellTopology &cellTopology, const ArrayPoint &cellVertices, int degree)
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.