SundanceUniformRefinementPair.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 #ifndef SUNDANCE_UNIFORM_REFINEMENT_PAIR_H
00043 #define SUNDANCE_UNIFORM_REFINEMENT_PAIR_H
00044 
00045 #include "SundanceDefs.hpp"
00046 #include "SundanceMeshType.hpp"
00047 #include "SundanceMesh.hpp"
00048 #include "SundanceArrayOfTuples.hpp"
00049 
00050 namespace Sundance
00051 {
00052 /**
00053  *
00054  */
00055 class UniformRefinementPair
00056 {
00057 public:
00058   /** */
00059   UniformRefinementPair();
00060   /** */
00061   UniformRefinementPair(const MeshType& meshType,
00062     const Mesh& coarse);
00063 
00064   /** */
00065   const Mesh& fine() const {return fine_;}
00066 
00067   /** */
00068   const Mesh& coarse() const {return coarse_;}
00069 
00070   /** */
00071   const Array<int>& oldToNewVertMap() const {return oldToNewVertMap_;}
00072 
00073   /** */
00074   const Array<int>& newVertToOldLIDMap() const {return newVertToOldLIDMap_;}
00075 
00076   /** */
00077   const Array<int>& newVertIsOnEdge() const {return newVertIsOnEdge_;}
00078 
00079   /** */
00080   const Array<int>& oldEdgeToNewVertMap() const {return oldEdgeToNewVertMap_;}
00081 
00082   /** */
00083   const ArrayOfTuples<int>& oldToNewElemMap() const 
00084     {return oldToNewElemMap_;}
00085 
00086   /** */
00087   const Array<int>& newToOldElemMap() const 
00088     {return newToOldElemMap_;}
00089 
00090   /** */
00091   const Array<Array<int> >& oldEdgeChildren() const 
00092     {return oldEdgeChildren_;}
00093 
00094   /** */
00095   const Array<Array<int> >& oldEdgeParallels() const 
00096     {return oldEdgeParallels_;}
00097   /** */
00098   const Array<int>& newEdgeParents() const 
00099     {return newEdgeParents_;}
00100 
00101   /** */
00102   const Array<int>& newEdgeParallels() const 
00103     {return newEdgeParallels_;}
00104 
00105 
00106   /** */
00107   const ArrayOfTuples<int>& interiorEdgesOfCoarseElems() const 
00108     {return interiorEdges_;}
00109 
00110 
00111   /** Run a consistency check on the pair of meshes. Returns the number
00112    * of errors detected. */
00113   int check() const ;
00114 
00115 protected:
00116   void refineTriMesh();
00117 
00118   int lookupEdge(const Mesh& mesh, int v1, int v2) const ;
00119   
00120 private:
00121   MeshType meshType_;
00122   Mesh coarse_;
00123   Mesh fine_;
00124 
00125   Array<int> oldToNewVertMap_;
00126   Array<int> newVertIsOnEdge_;
00127   Array<int> newVertToOldLIDMap_;
00128   Array<int> oldEdgeToNewVertMap_;
00129 
00130   ArrayOfTuples<int> oldToNewElemMap_;
00131   Array<int> newToOldElemMap_;
00132 
00133   Array<Array<int> > oldEdgeChildren_;
00134   Array<Array<int> > oldEdgeParallels_;
00135   Array<int> newEdgeParents_;
00136   Array<int> newEdgeParallels_;
00137 
00138   ArrayOfTuples<int> interiorEdges_;
00139 };
00140 
00141 }
00142 
00143 
00144 #endif

Site Contact