cell_pyramid.c

一个用来实现偏微分方程中网格的计算库

// $Id: cell_pyramid.C 2789 2008-04-13 02:24:40Z roystgnr $

// The libMesh Finite Element Library.
// Copyright (C) 2002-2007  Benjamin S. Kirk, John W. Peterson
  
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
  
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
  
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA


// C++ includes

// Local includes
#include "cell_pyramid.h"
#include "cell_pyramid5.h"
#include "face_tri3.h"
#include "face_quad4.h"


// ------------------------------------------------------------
// Pyramid class member functions
unsigned int Pyramid::key (const unsigned int s) const
{  
  libmesh_assert (s < this->n_sides());

  
  switch (s)
    {
    case 0:  // triangular face 1

      return
	this->compute_key (this->node(0),
			   this->node(1),
			   this->node(4));
      	
    case 1:  // triangular face 2

      return
	this->compute_key (this->node(1),
			   this->node(2),
			   this->node(4));
	
    case 2:  // triangular face 3

      return
	this->compute_key (this->node(2),
			   this->node(3),
			   this->node(4));
      	
    case 3:  // triangular face 4

      return
	this->compute_key (this->node(3),
			   this->node(0),
			   this->node(4));
      
    case 4:  // the quad face at z=0

      return
	this->compute_key (this->node(0),
			   this->node(3),
			   this->node(2),
			   this->node(1));
    }

  // We'll never get here.
  libmesh_error();
  return 0;
}



AutoPtr<DofObject> Pyramid::side (const unsigned int i) const
{
  libmesh_assert (i < this->n_sides());


  
  switch (i)
    {
    case 0:  // triangular face 1
      {
        Elem* face = new Tri3;

	face->set_node(0) = this->get_node(0);
	face->set_node(1) = this->get_node(1);
	face->set_node(2) = this->get_node(4);
	
        AutoPtr<DofObject> ap_face(face);
	return ap_face;
      }
    case 1:  // triangular face 2
      {
        Elem* face = new Tri3;

	face->set_node(0) = this->get_node(1);
	face->set_node(1) = this->get_node(2);
	face->set_node(2) = this->get_node(4);
	
        AutoPtr<DofObject> ap_face(face);
	return ap_face;
      }
    case 2:  // triangular face 3
      {
        Elem* face = new Tri3;

	face->set_node(0) = this->get_node(2);
	face->set_node(1) = this->get_node(3);
	face->set_node(2) = this->get_node(4);
	
        AutoPtr<DofObject> ap_face(face);
	return ap_face;
      }
    case 3:  // triangular face 4
      {
        Elem* face = new Tri3;

	face->set_node(0) = this->get_node(3);
	face->set_node(1) = this->get_node(0);
	face->set_node(2) = this->get_node(4);
	
        AutoPtr<DofObject> ap_face(face);
	return ap_face;
      }
    case 4:  // the quad face at z=0
      {
        Elem* face = new Quad4;
	
	face->set_node(0) = this->get_node(0);
	face->set_node(1) = this->get_node(3);
	face->set_node(2) = this->get_node(2);
	face->set_node(3) = this->get_node(1);

        AutoPtr<DofObject> ap_face(face);
	return ap_face;
      }
    default:
      {
	libmesh_error();
	AutoPtr<DofObject> ap_face(NULL);
	return ap_face;
      }
    }

  // We'll never get here.
  libmesh_error();
  AutoPtr<DofObject> ap_face(NULL);

  return ap_face;
}



bool Pyramid::is_child_on_side(const unsigned int c,
                             const unsigned int s) const
{
  libmesh_assert (c < this->n_children());
  libmesh_assert (s < this->n_sides());

  for (unsigned int i = 0; i != 4; ++i)
    if (Pyramid5::side_nodes_map[s][i] == c)
      return true;
  return false;
}