cell_inf_prism.c

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

// $Id: cell_inf_prism.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

// Local includes
#include "libmesh_config.h"
#ifdef ENABLE_INFINITE_ELEMENTS


// C++ includes
// include <algorithm>

// Local includes cont'd
#include "cell_inf_prism.h"
#include "face_tri3.h"
#include "face_inf_quad4.h"




// ------------------------------------------------------------
// InfPrism class member functions
unsigned int InfPrism::key (const unsigned int s) const
{
  libmesh_assert (s < this->n_sides());
  
  switch (s)
    {
    case 0:  // the triangular face at z=-1, base face

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

    case 1:  // the quad face at y=0

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

    case 2:  // the other quad face

      return
	this->compute_key (this->node(1),
			   this->node(2),
			   this->node(5),
			   this->node(4));

    case 3: // the quad face at x=0

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

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



AutoPtr<DofObject> InfPrism::side (const unsigned int i) const
{
  libmesh_assert (i < this->n_sides());
  
  switch (i)
    {
    case 0:  // the triangular face at z=-1, base face
      {
        Elem* face = new Tri3;
        AutoPtr<DofObject> ap_face(face);
	//AutoPtr<Elem> face(new Tri3);

	// Note that for this face element, the normal points inward
	face->set_node(0) = this->get_node(0);
	face->set_node(1) = this->get_node(1);
	face->set_node(2) = this->get_node(2);

	return ap_face;
      }

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

    case 2:  // the other quad face
      {
        Elem* face = new InfQuad4;
        AutoPtr<DofObject> ap_face(face);
	//AutoPtr<Elem> face(new InfQuad4);

	face->set_node(0) = this->get_node(1);
	face->set_node(1) = this->get_node(2);
	face->set_node(2) = this->get_node(4);
	face->set_node(3) = this->get_node(5);

	return ap_face;
      }

    case 3: // the quad face at x=0
      {
        Elem* face = new InfQuad4;
        AutoPtr<DofObject> ap_face(face);
	//AutoPtr<Elem> face(new InfQuad4);

	face->set_node(0) = this->get_node(2);
	face->set_node(1) = this->get_node(0);
	face->set_node(2) = this->get_node(5);
	face->set_node(3) = this->get_node(3);
	
	return ap_face;
      }

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

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



bool InfPrism::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());

  return (s == 0 || c+1 == s || c == s%3);
}



#endif // ifdef ENABLE_INFINITE_ELEMENTS