00001 /* @HEADER@ */ 00002 // ************************************************************************ 00003 // 00004 // Sundance 00005 // Copyright (2005) Sandia Corporation 00006 // 00007 // Copyright (year first published) Sandia Corporation. Under the terms 00008 // of Contract DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government 00009 // retains certain rights in this software. 00010 // 00011 // This library is free software; you can redistribute it and/or modify 00012 // it under the terms of the GNU Lesser General Public License as 00013 // published by the Free Software Foundation; either version 2.1 of the 00014 // License, or (at your option) any later version. 00015 // 00016 // This library is distributed in the hope that it will be useful, but 00017 // WITHOUT ANY WARRANTY; without even the implied warranty of 00018 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00019 // Lesser General Public License for more details. 00020 // 00021 // You should have received a copy of the GNU Lesser General Public 00022 // License along with this library; if not, write to the Free Software 00023 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 00024 // USA 00025 // Questions? Contact Kevin Long (krlong@sandia.gov), 00026 // Sandia National Laboratories, Livermore, California, USA 00027 // 00028 // ************************************************************************ 00029 /* @HEADER@ */ 00030 00031 #ifndef SUNDANCE_GEOMUTILS_H 00032 #define SUNDANCE_GEOMUTILS_H 00033 00034 #include "SundanceDefs.hpp" 00035 #include "SundanceMesh.hpp" 00036 #include <list> 00037 00038 namespace Sundance 00039 { 00040 /** \relates Mesh 00041 * Return the LID of the maximal cell that contains the point x. 00042 * If the point lays on an edge between two or more 00043 * cells, this will return the first of the those cells encountered 00044 * on a breadth-first search starting at the initial guess. 00045 */ 00046 int findEnclosingCell(const Mesh& mesh, 00047 int cellDim, 00048 int initialGuessLID, 00049 const double* x); 00050 00051 /** \relates Mesh 00052 * Test whether a point is enclosed in a cell. The cell is assumed 00053 * to be simplicial. 00054 */ 00055 bool cellContainsPoint(const Mesh& mesh, 00056 int cellDim, 00057 int cellLID, const double* x, 00058 Array<int>& facetLID); 00059 00060 /** \relates Mesh 00061 * Tests orientation of a point relative to a line. 00062 */ 00063 double orient2D(const double* a, const double* b, const double* x); 00064 00065 /** \relates Mesh 00066 * Get the list of maximal neighbors of a cell 00067 */ 00068 void maximalNeighbors(const Mesh& mesh, int cellDim, 00069 int cellLID, const Array<int>& facetLID, 00070 std::list<int>& rtn); 00071 00072 /** \relates Mesh 00073 * Pullback a point to local coordinates within a cell 00074 */ 00075 Point pullback(const Mesh& mesh, int cellDim, int cellLID, const double* x); 00076 00077 /** */ 00078 void printCell(const Mesh& mesh, int cellLID); 00079 00080 /** */ 00081 double volume(const Mesh& mesh, int cellDim, int cellLID); 00082 00083 00084 } 00085 00086 00087 #endif 00088 00089