cell_prism.c

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

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


// C++ includes

// Local includes
#include "cell_prism.h"
#include "cell_prism6.h"
#include "face_quad4.h"
#include "face_tri3.h"


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

  switch (s)
    {
    case 0:  // the triangular face at z=0

      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));	
    case 4: // the triangular face at z=1

      return
	this->compute_key (this->node(3),
			   this->node(4),
			   this->node(5));
    }
  
  // We'll never get here.
  libmesh_error();
  return 0;
}



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

  switch (i)
    {
    case 0:  // the triangular face at z=0
      {
        Elem* facet = new Tri3;
        AutoPtr<DofObject> ap_facet(facet);
  
	facet->set_node(0) = this->get_node(0);
	facet->set_node(1) = this->get_node(2);
	facet->set_node(2) = this->get_node(1);

        return ap_facet;
      }
    case 1:  // the quad face at y=0
      {
        Elem* faceq = new Quad4;
        AutoPtr<DofObject> ap_faceq(faceq);
        
	faceq->set_node(0) = this->get_node(0);
	faceq->set_node(1) = this->get_node(1);
	faceq->set_node(2) = this->get_node(4);
	faceq->set_node(3) = this->get_node(3);
	
	return ap_faceq;
      }
    case 2:  // the other quad face
      {
        Elem* faceq = new Quad4;
        AutoPtr<DofObject> ap_faceq(faceq);
      
	faceq->set_node(0) = this->get_node(1);
	faceq->set_node(1) = this->get_node(2);
	faceq->set_node(2) = this->get_node(5);
	faceq->set_node(3) = this->get_node(4);

	return ap_faceq;
      }
    case 3: // the quad face at x=0
      {
        Elem* faceq = new Quad4;
        AutoPtr<DofObject> ap_faceq(faceq);

	faceq->set_node(0) = this->get_node(2);
	faceq->set_node(1) = this->get_node(0);
	faceq->set_node(2) = this->get_node(3);
	faceq->set_node(3) = this->get_node(5);
	
	return ap_faceq;
      }
    case 4: // the triangular face at z=1
      {
        Elem* facet = new Tri3;
        AutoPtr<DofObject> ap_facet(facet);
      
	facet->set_node(0) = this->get_node(3);
	facet->set_node(1) = this->get_node(4);
	facet->set_node(2) = this->get_node(5);
        
        return ap_facet;
      }
    default:
      {
	libmesh_error();
        Elem* facet = new Tri3;
        AutoPtr<DofObject> ap_facet(facet);
        return ap_facet;
      }
    }

  // We'll never get here.
  libmesh_error();
  Elem* facet = new Tri3;
  AutoPtr<DofObject> ap_facet(facet);
  return ap_facet;
}



bool Prism::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 (Prism6::side_nodes_map[s][i] == c)
      return true;
  return false;
}



const unsigned short int Prism::_second_order_vertex_child_number[18] =
{
  99,99,99,99,99,99, // Vertices
  0,1,0,0,1,2,3,4,3, // Edges
  0,1,0              // Faces
};



const unsigned short int Prism::_second_order_vertex_child_index[18] =
{
  99,99,99,99,99,99, // Vertices
  1,2,2,3,4,5,4,5,5, // Edges
  4,5,5              // Faces
};


const unsigned short int Prism::_second_order_adjacent_vertices[9][2] = 
{
  { 0,  1}, // vertices adjacent to node 6 
  { 1,  2}, // vertices adjacent to node 7 
  { 0,  2}, // vertices adjacent to node 8 

  { 0,  3}, // vertices adjacent to node 9 
  { 1,  4}, // vertices adjacent to node 10 
  { 2,  5}, // vertices adjacent to node 11

  { 3,  4}, // vertices adjacent to node 12
  { 4,  5}, // vertices adjacent to node 13
  { 3,  5}  // vertices adjacent to node 14
};