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_ATOCPOINTLOCATOR_H 00043 #define SUNDANCE_ATOCPOINTLOCATOR_H 00044 00045 #include "SundanceDefs.hpp" 00046 #include "SundanceMesh.hpp" 00047 #include "SundanceExpr.hpp" 00048 #include "SundanceCellFilter.hpp" 00049 00050 namespace Sundance 00051 { 00052 using namespace Sundance; 00053 using namespace Sundance; 00054 using namespace Sundance; 00055 using namespace Sundance; 00056 using namespace Sundance; 00057 using namespace Teuchos; 00058 00059 /** 00060 * AToCPointLocator finds the cell index for a point within an unstructured 00061 * mesh. 00062 * 00063 * Note: not tested in parallel. 00064 */ 00065 class AToCPointLocator 00066 { 00067 public: 00068 /** */ 00069 AToCPointLocator(const Mesh& mesh, 00070 const CellFilter& subdomain, 00071 const std::vector<int>& nx); 00072 00073 00074 00075 /** Find the index of a point in an overlaid structured grid. */ 00076 int getGridIndex(const double* x) const ; 00077 00078 /** Use an overlaid structured grid to estimate the location of the point. */ 00079 int guessCell(const double* x) const 00080 {return (*table_)[getGridIndex(x)];} 00081 00082 /** Find the cell that contains the specified point */ 00083 int findEnclosingCell(int initialGuessLID, const double* x) const ; 00084 00085 /** Find the cell that contains the specified point, also 00086 * computing local coordinates within that cell. */ 00087 int findEnclosingCell(int initialGuessLID, const double* x, 00088 double* localCoords) const ; 00089 00090 /** */ 00091 void fillMaximalNeighbors(int cellLID, const int* facetLID) const ; 00092 00093 /** Test whether a point is within a specified cell */ 00094 bool cellContainsPoint(int cellLID, 00095 const double* x, 00096 const int* facetLID) const ; 00097 00098 /** Test whether a point is within a specified cell, and if so, 00099 * compute local coordinates within that cell. */ 00100 bool cellContainsPoint(int cellLID, 00101 const double* x, 00102 const int* facetLID, 00103 double* localCoords) const ; 00104 00105 /** */ 00106 const Mesh& mesh() const {return mesh_;} 00107 00108 /** */ 00109 const CellFilter& subdomain() const {return subdomain_;} 00110 00111 00112 00113 /** */ 00114 static Point makePoint(int dim, const double* x) ; 00115 private: 00116 00117 /** Find the range of structured grid cells within the bounding box of 00118 * a cell. */ 00119 void getGridRange(const Mesh& mesh, int cellDim, int cellLID, 00120 Array<int>& lowIndex, Array<int>& highIndex) const; 00121 00122 00123 00124 00125 int dim_; 00126 Mesh mesh_; 00127 int nFacets_; 00128 std::vector<int> nx_; 00129 Array<double> low_; 00130 Array<double> high_; 00131 Array<double> dx_; 00132 RCP<Array<int> > table_; 00133 CellFilter subdomain_; 00134 mutable Array<RCP<Set<int> > > neighborSet_; 00135 }; 00136 } 00137 00138 00139 #endif