SundanceRivaraMesh.hpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                             Sundance
00005 //                 Copyright 2011 Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu)
00038 // 
00039 
00040 /* @HEADER@ */
00041 
00042 
00043 #ifndef SUNDANCERIVARAMESH_HPP
00044 #define SUNDANCERIVARAMESH_HPP
00045 
00046 #include "SundanceDefs.hpp"
00047 #include "SundanceRivaraElement.hpp"
00048 #include <stack>
00049 #include "SundanceMap.hpp"
00050 #include "SundanceIncrementallyCreatableMesh.hpp"
00051 #include "SundanceRivaraElementIterator.hpp"
00052 
00053 
00054 namespace Sundance
00055 {
00056 namespace Rivara
00057 {
00058 using Sundance::Map;
00059 
00060 
00061 class RivaraMesh 
00062 {
00063 public:
00064   RivaraMesh(int dim, const MPIComm& comm);
00065 
00066   int addNode(const RCP<Node>& node);
00067   int addVertex(int globalIndex, const Point& x, int ownerProcID, int label);
00068 
00069   void addElement(const RCP<Element>& tri);
00070   int addElement(int globalIndex, const Array<int>& vertexGIDs, int ownerProc,
00071     int label);
00072 
00073   RCP<Edge> tryEdge(const RCP<Node>& a,
00074     const RCP<Node>& b,
00075     int& edgeSign);
00076 
00077   RCP<Face> tryFace(const RCP<Node>& a,
00078     const RCP<Node>& b,
00079     const RCP<Node>& c);
00080 
00081   const RCP<Face>& getFace(const RCP<Node>& a,
00082     const RCP<Node>& b,
00083     const RCP<Node>& c) const ;
00084 
00085   const RCP<Node>& node(int i) const {return nodes_[i];}
00086 
00087   int numNodes() const {return nodes_.length();}
00088 
00089   std::stack<Element*>& refinementSet()
00090     {return refinementSet_;}
00091 
00092   std::stack<double>& refinementAreas()
00093     {return refinementAreas_;}
00094 
00095   void refine();
00096 
00097   ElementIterator iterator() const ;
00098 
00099   friend class ElementIterator;
00100 
00101   RCP<Element> element(int i) const {return elements_[i];}
00102 
00103   int numRootElements() const {return elements_.length();}
00104 
00105   int numElements() const ;
00106 
00107   int spatialDim() const ;
00108 
00109   int& nextGID() {return nextGID_;}
00110 
00111   int nextGID() const {return nextGID_;}
00112 private:
00113 
00114   int spatialDim_;
00115   
00116   int nextGID_;
00117 
00118   Array<RCP<Node> > nodes_;
00119 
00120   Array<RCP<Edge> > edges_;
00121 
00122   Array<RCP<Face> > faces_;
00123 
00124   Array<RCP<Element> > elements_;
00125 
00126   Array<Map<int, int> > nodeToEdgeMap_;
00127 
00128   Map<FaceNodes, int> faceToLIDMap_;
00129 
00130   std::stack<Element*> refinementSet_;
00131 
00132   std::stack<double> refinementAreas_;
00133 };
00134 }
00135 }
00136 
00137 #endif

Site Contact