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_GEOMUTILS_H 00043 #define SUNDANCE_GEOMUTILS_H 00044 00045 #include "SundanceDefs.hpp" 00046 #include "SundanceMesh.hpp" 00047 #include <list> 00048 00049 namespace Sundance 00050 { 00051 /** \relates Mesh 00052 * Return the LID of the maximal cell that contains the point x. 00053 * If the point lays on an edge between two or more 00054 * cells, this will return the first of the those cells encountered 00055 * on a breadth-first search starting at the initial guess. 00056 */ 00057 int findEnclosingCell(const Mesh& mesh, 00058 int cellDim, 00059 int initialGuessLID, 00060 const double* x); 00061 00062 /** \relates Mesh 00063 * Test whether a point is enclosed in a cell. The cell is assumed 00064 * to be simplicial. 00065 */ 00066 bool cellContainsPoint(const Mesh& mesh, 00067 int cellDim, 00068 int cellLID, const double* x, 00069 Array<int>& facetLID); 00070 00071 /** \relates Mesh 00072 * Tests orientation of a point relative to a line. 00073 */ 00074 double orient2D(const double* a, const double* b, const double* x); 00075 00076 /** \relates Mesh 00077 * Get the list of maximal neighbors of a cell 00078 */ 00079 void maximalNeighbors(const Mesh& mesh, int cellDim, 00080 int cellLID, const Array<int>& facetLID, 00081 std::list<int>& rtn); 00082 00083 /** \relates Mesh 00084 * Pullback a point to local coordinates within a cell 00085 */ 00086 Point pullback(const Mesh& mesh, int cellDim, int cellLID, const double* x); 00087 00088 /** */ 00089 void printCell(const Mesh& mesh, int cellLID); 00090 00091 /** */ 00092 double volume(const Mesh& mesh, int cellDim, int cellLID); 00093 00094 /** \relates Mesh */ 00095 int lookupEdgeLIDFromVerts(const Mesh& mesh, int v1, int v2); 00096 } 00097 00098 00099 #endif 00100 00101