CN.hpp

Go to the documentation of this file.

/**
 * MOAB, a Mesh-Oriented datABase, is a software component for creating,
 * storing and accessing finite element mesh data.
 *
 * Copyright 2004 Sandia Corporation.  Under the terms of Contract
 * DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government
 * retains certain rights in this software.
 *
 * 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.
 *
 */

/**
 * \class moab::CN
 * \author Tim Tautges
 * \date April 2004
 *
 * \brief Canonical numbering data and functions
 * This class represents canonical ordering of finite-element meshes.
 * Elements in the finite element "zoo" are represented.  Canonical numbering
 * denotes the vertex, edge, and face numbers making up each kind of element,
 * and the vertex numbers defining those entities.  Functions for evaluating
 * adjacencies and other things based on vertex numbering are also provided.
 * By default, this class defines a zero-based numbering system.
 * For a complete description of this class, see the document "MOAB Canonical
 * Numbering Conventions", Timothy J. Tautges, Sandia National Laboratories
 * Report #SAND2004-xxxx.
 */
#ifndef MOAB_CN_HPP
#define MOAB_CN_HPP

#include <vector>
#include <algorithm>
#include <cassert>

#include "moab/EntityType.hpp"

#include "moab/win32_config.h"

namespace moab
{

enum
{
    //! the maximum number n-1 dimension adjacencies a element may have
    MAX_SUB_ENTITIES = 12,
    //! the maximum number of nodes an n-1 dimensional element may have
    MAX_SUB_ENTITY_VERTICES = 9
};

typedef std::pair< EntityType, EntityType > DimensionPair;

class CN
{
  private:
    //! entity names
    static MOAB_EXPORT const char* entityTypeNames[];

    //! declare private constructor, since we don't want to create any of these
    CN();

    //! the basis of the numbering system (normally 0 or 1, 0 by default)
    static MOAB_EXPORT short int numberBasis;

    //! switch the basis
    static void SwitchBasis( const int old_basis, const int new_basis );

    static MOAB_EXPORT short increasingInts[];

  public:
    enum
    {
        MAX_NODES_PER_ELEMENT = 27
    };
    enum
    {
        MID_EDGE_BIT   = 1 << 1,
        MID_FACE_BIT   = 1 << 2,
        MID_REGION_BIT = 1 << 3
    };

    //! enum used to specify operation type
    enum
    {
        INTERSECT = 0,
        UNION
    };

    // each entity type has two ConnMap objects, holding information about the bounding
    // edges and faces for each entity; see comment for mConnectivityMap
    // (this struct not documented with Doxygen)
    struct ConnMap
    {
        // Topological dimension of this entry
        short int topo_dimension;

        // Number of sub-elements of this dimension
        short int num_sub_elements;

        // Number of nodes in each sub-element of this dimension
        short int num_corners_per_sub_element[MAX_SUB_ENTITIES];

        // Type of each sub-element
        EntityType target_type[MAX_SUB_ENTITIES];

        // Connectivity of each of the sub-elements
        short int conn[MAX_SUB_ENTITIES][MAX_SUB_ENTITY_VERTICES];
    };

    // mConnectivityMap[i=entity type][j=0,1,2]:
    //  num_sub_elements = # bounding edges(j=0) or faces(j=1) for entity type i, or self (j=2)
    //  num_corners_per_sub_element[k] (k=0..num_sub_elements-1) = number of nodes in sub-facet k
    //    (can vary over sub-facets, e.g. faces bounding a pyramid) or self (j=2)
    //  target_type[k] = entity type of sub-facet k (e.g. MBTRI or MBQUAD bounding a pyramid) or
    //  self (j=2) conn[k][l] (l=0..CN::VerticesPerEntity[target_type[k]]) = vertex connectivity of
    //  sub-facet k,
    //    with respect to entity i's canonical vertex ordering, or self (j=2)
    // (not documented with Doxygen)
    static MOAB_EXPORT const ConnMap mConnectivityMap[MBMAXTYPE][3];

    // structure used to define reverse canonical ordering information
    // (not documented with Doxygen)
    struct UpConnMap
    {
        // Number of higher-dimensional entities using each sub-entity
        short int num_targets_per_source_element[MAX_SUB_ENTITIES];

        // Higher-dimensional entities using each sub-entity
        short int targets_per_source_element[MAX_SUB_ENTITIES][MAX_SUB_ENTITIES];
    };

    // Reverse canonical numbering, duplicates data in mConnectivityMap, but
    // connectivity data in this table must be in ascending order (used for
    // efficient sorting)
    // (not documented with Doxygen)
    static const UpConnMap mUpConnMap[MBMAXTYPE][4][4];

    // Mid-node bits indexed by number of nodes in element
    static MOAB_EXPORT const unsigned char midNodesPerType[MBMAXTYPE][MAX_NODES_PER_ELEMENT + 1];

    //! Permutation and reverse permutation vectors
    static short int permuteVec[MBMAXTYPE][3][MAX_SUB_ENTITIES + 1];
    static short int revPermuteVec[MBMAXTYPE][3][MAX_SUB_ENTITIES + 1];

    //! this const vector defines the starting and ending EntityType for
    //! each dimension, e.g. TypeDimensionMap[2] returns a pair of EntityTypes
    //! bounding dimension 2.
    static MOAB_EXPORT const DimensionPair TypeDimensionMap[];

    /// Get the dimension pair corresponding to a dimension
    static DimensionPair getDimPair( int entity_type );

    //! get the basis of the numbering system
    static short int GetBasis();

    //! set the basis of the numbering system
    static void SetBasis( const int in_basis );

    //! return the string type name for this type
    static const char* EntityTypeName( const EntityType this_type );

    //! given a name, find the corresponding entity type
    static EntityType EntityTypeFromName( const char* name );

    //! return the topological entity dimension
    static short int Dimension( const EntityType t );

    //! return the number of (corner) vertices contained in the specified type.
    static short int VerticesPerEntity( const EntityType t );

    //! return the number of sub-entities bounding the entity.
    static short int NumSubEntities( const EntityType t, const int d );

    //! return the type of a particular sub-entity.
    //! \param this_type Type of entity for which sub-entity type is being queried
    //! \param sub_dimension Topological dimension of sub-entity whose type is being queried
    //! \param index Index of sub-entity whose type is being queried
    //! \return type Entity type of sub-entity with specified dimension and index
    static EntityType SubEntityType( const EntityType this_type, const int sub_dimension, const int index );

    //! return the vertex indices of the specified sub-entity.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param sub_dimension Dimension of sub-entity
    //! \param sub_index Index of sub-entity
    //! \param sub_entity_conn Connectivity of sub-entity (returned to calling function)
    static void inline SubEntityVertexIndices( const EntityType this_type, const int sub_dimension, const int sub_index,
                                               int sub_entity_conn[] );

    //! return the vertex indices of the specified sub-entity.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param sub_dimension Dimension of sub-entity
    //! \param sub_index Index of sub-entity
    //! \param num_sub_ent_vertices the number of vertices in the sub-entity
    static const short* SubEntityVertexIndices( const EntityType this_type, const int sub_dimension,
                                                const int sub_index, EntityType& sub_type, int& num_sub_ent_vertices );

    //! return the node indices of the specified sub-entity.
    //! \param this_topo            The topology of the queried element type
    //! \param num_nodes            The number of nodes in the queried element type.
    //! \param sub_dimension        Dimension of sub-entity
    //! \param sub_index            Index of sub-entity
    //! \param sub_entity_topo      (Output) Topology of requested sub-entity.
    //! \param num_sub_entity_nodes (Output) Number of nodes in the requested sub-entity.
    //! \param sub_entity_conn      (Output) Connectivity of sub-entity
    static void SubEntityNodeIndices( const EntityType this_topo, const int num_nodes, const int sub_dimension,
                                      const int sub_index, EntityType& sub_entity_topo, int& num_sub_entity_nodes,
                                      int sub_entity_conn[] );

    //! return the vertices of the specified sub entity
    //! \param parent_conn Connectivity of parent entity
    //! \param parent_type Entity type of parent entity
    //! \param sub_dimension Dimension of sub-entity being queried
    //! \param sub_index Index of sub-entity being queried
    //! \param sub_entity_conn Connectivity of sub-entity, based on parent_conn and canonical
    //!           ordering for parent_type
    //! \param num_sub_vertices Number of vertices in sub-entity
    static void SubEntityConn( const void* parent_conn, const EntityType parent_type, const int sub_dimension,
                               const int sub_index, void* sub_entity_conn, int& num_sub_vertices );

    //! For a specified set of sides of given dimension, return the intersection
    //! or union of all sides of specified target dimension adjacent to those sides.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param source_indices Indices of sides being queried
    //! \param num_source_indices Number of entries in <em>source_indices</em>
    //! \param source_dim Dimension of source entity
    //! \param target_dim Dimension of target entity
    //! \param index_list Indices of target entities (returned)
    //! \param operation_type Specify either CN::INTERSECT or CN::UNION to get intersection
    //!        or union of target entity lists over source entities
    static short int AdjacentSubEntities( const EntityType this_type, const int* source_indices,
                                          const int num_source_indices, const int source_dim, const int target_dim,
                                          std::vector< int >& index_list, const int operation_type = CN::INTERSECT );

    //! return the side index represented in the input sub-entity connectivity in the input
    //! parent entity connectivity array.
    //! \param parent_conn Connectivity of parent entity being queried
    //! \param parent_type Entity type of parent entity
    //! \param child_conn Connectivity of child whose index is being queried
    //! \param child_num_verts Number of vertices in <em>child_conn</em>
    //! \param child_dim Dimension of child entity being queried
    //! \param side_number Side number of child entity (returned)
    //! \param sense Sense of child entity with respect to order in <em>child_conn</em> (returned)
    //! \param offset Offset of <em>child_conn</em> with respect to canonical ordering data
    //! (returned) \return status Returns zero if successful, -1 if not
    static short int SideNumber( const EntityType parent_type, const int* parent_conn, const int* child_conn,
                                 const int child_num_verts, const int child_dim, int& side_number, int& sense,
                                 int& offset );
    static short int SideNumber( const EntityType parent_type, const unsigned int* parent_conn,
                                 const unsigned int* child_conn, const int child_num_verts, const int child_dim,
                                 int& side_number, int& sense, int& offset );
    static short int SideNumber( const EntityType parent_type, const long* parent_conn, const long* child_conn,
                                 const int child_num_verts, const int child_dim, int& side_number, int& sense,
                                 int& offset );
    static short int SideNumber( const EntityType parent_type, const unsigned long* parent_conn,
                                 const unsigned long* child_conn, const int child_num_verts, const int child_dim,
                                 int& side_number, int& sense, int& offset );
    static short int SideNumber( const EntityType parent_type, const unsigned long long* parent_conn,
                                 const unsigned long long* child_conn, const int child_num_verts, const int child_dim,
                                 int& side_number, int& sense, int& offset );
    static short int SideNumber( const EntityType parent_type, void* const* parent_conn, void* const* child_conn,
                                 const int child_num_verts, const int child_dim, int& side_number, int& sense,
                                 int& offset );

    //! return the side index represented in the input sub-entity connectivity
    //! \param parent_type Entity type of parent entity
    //! \param child_conn_indices Child connectivity to query, specified as indices
    //!                           into the connectivity list of the parent.
    //! \param child_num_verts Number of values in <em>child_conn_indices</em>
    //! \param child_dim Dimension of child entity being queried
    //! \param side_number Side number of child entity (returned)
    //! \param sense Sense of child entity with respect to order in <em>child_conn</em> (returned)
    //! \param offset Offset of <em>child_conn</em> with respect to canonical ordering data
    //! (returned) \return status Returns zero if successful, -1 if not
    static short int SideNumber( const EntityType parent_type, const int* child_conn_indices, const int child_num_verts,
                                 const int child_dim, int& side_number, int& sense, int& offset );

    //! return the dimension and index of the opposite side, given parent entity type and child
    //! dimension and index.  This function is only defined for certain types of parent/child types:
    //! (Parent, Child dim->Opposite dim):
    //!  (Tri, 1->0), (Tri, 0->1), (Quad, 1->1), (Quad, 0->0),
    //!  (Tet, 2->0), (Tet, 1->1), (Tet, 0->2),
    //!  (Hex, 2->2), (Hex, 1->1)(diagonally across element), (Hex, 0->0) (diagonally across
    //!  element)
    //! All other parent types and child dimensions return an error.
    //!
    //! \param parent_type The type of parent element
    //! \param child_type The type of child element
    //! \param child_index The index of the child element
    //! \param opposite_index The index of the opposite element
    //! \return status Returns 0 if successful, -1 if not
    static short int OppositeSide( const EntityType parent_type, const int child_index, const int child_dim,
                                   int& opposite_index, int& opposite_dim );

    //! given two connectivity arrays, determine whether or not they represent the same entity.
    //! \param conn1 Connectivity array of first entity
    //! \param conn2 Connectivity array of second entity
    //! \param num_vertices Number of entries in <em>conn1</em> and <em>conn2</em>
    //! \param direct If positive, entities have the same sense (returned)
    //! \param offset Offset of <em>conn2</em>'s first vertex in <em>conn1</em>
    //! \return bool Returns true if <em>conn1</em> and <em>conn2</em> match
    static bool ConnectivityMatch( const int* conn1, const int* conn2, const int num_vertices, int& direct,
                                   int& offset );
    static bool ConnectivityMatch( const unsigned int* conn1, const unsigned int* conn2, const int num_vertices,
                                   int& direct, int& offset );
    static bool ConnectivityMatch( const long* conn1, const long* conn2, const int num_vertices, int& direct,
                                   int& offset );
    static bool ConnectivityMatch( const unsigned long* conn1, const unsigned long* conn2, const int num_vertices,
                                   int& direct, int& offset );
    static bool ConnectivityMatch( const unsigned long long* conn1, const unsigned long long* conn2,
                                   const int num_vertices, int& direct, int& offset );
    static bool ConnectivityMatch( void* const* conn1, void* const* conn2, const int num_vertices, int& direct,
                                   int& offset );

    //! Set permutation or reverse permutation vector
    //! Forward permutation is from CN's numbering into application's ordering;
    //! that is, if i is CN's index, pvec[i] is application's index.  This
    //! function stores the permutation vector for this type and facet dimension,
    //! which then is used in calls to permuteThis or revPermuteThis.
    //! \param t EntityType for which to set permutation
    //! \param dim Dimension of facets whose permutation array is being set
    //! \param pvec Permutation array
    //! \param num_entries Number of indicies in permutation array
    //! \param is_reverse Array is reverse permutation
    static inline void setPermutation( const EntityType t, const int dim, short int* pvec, const int num_entries,
                                       const bool is_reverse = false );

    //! Reset permutation or reverse permutation vector
    //! \param t EntityType whose permutation vector is being reset
    //! \param dim Dimension of facets being reset; if -1 is input, all dimensions are reset
    static inline void resetPermutation( const EntityType t, const int dim );

    //! Permute a handle array according to permutation vector set with setPermute;
    //! permutation is done in-place
    //! \param t EntityType of handles in pvec
    //! \param dim Dimension of handles in pvec
    //! \param pvec Handle array being permuted
    //! \param indices_per_ent Number of indices per entity
    //! \param num_entries Number of entities in pvec
    static int permuteThis( const EntityType t, const int dim, int* pvec, const int indices_per_ent,
                            const int num_entries );
    static int permuteThis( const EntityType t, const int dim, unsigned int* pvec, const int indices_per_ent,
                            const int num_entries );
    static int permuteThis( const EntityType t, const int dim, long* pvec, const int indices_per_ent,
                            const int num_entries );
    static int permuteThis( const EntityType t, const int dim, void** pvec, const int indices_per_ent,
                            const int num_entries );

    //! Reverse permute a handle array according to reverse permutation vector set with setPermute;
    //! reverse permutation is done in-place
    //! \param t EntityType of handles in pvec
    //! \param dim Dimension of handles in pvec
    //! \param pvec Handle array being reverse permuted
    //! \param indices_per_ent Number of indices per entity
    //! \param num_entries Number of entities in pvec
    static int revPermuteThis( const EntityType t, const int dim, int* pvec, const int indices_per_ent,
                               const int num_entries );
    static int revPermuteThis( const EntityType t, const int dim, unsigned int* pvec, const int indices_per_ent,
                               const int num_entries );
    static int revPermuteThis( const EntityType t, const int dim, long* pvec, const int indices_per_ent,
                               const int num_entries );
    static int revPermuteThis( const EntityType t, const int dim, void** pvec, const int indices_per_ent,
                               const int num_entries );

    //! true if entities of a given type and number of nodes indicates mid edge nodes are present.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param num_verts Number of nodes defining entity
    //! \return bool Returns true if <em>this_type</em> combined with <em>num_nodes</em> indicates
    //!  mid-edge nodes are likely
    static inline bool HasMidEdgeNodes( const EntityType this_type, const int num_verts );

    //! true if entities of a given type and number of nodes indicates mid face nodes are present.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param num_verts Number of nodes defining entity
    //! \return bool Returns true if <em>this_type</em> combined with <em>num_nodes</em> indicates
    //!  mid-face nodes are likely
    static inline bool HasMidFaceNodes( const EntityType this_type, const int num_verts );

    //! true if entities of a given type and number of nodes indicates mid region nodes are present.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param num_verts Number of nodes defining entity
    //! \return bool Returns true if <em>this_type</em> combined with <em>num_nodes</em> indicates
    //!  mid-region nodes are likely
    static inline bool HasMidRegionNodes( const EntityType this_type, const int num_verts );

    //! true if entities of a given type and number of nodes indicates mid edge/face/region nodes
    //! are present.
    //! \param this_type Type of entity for which sub-entity connectivity is being queried
    //! \param num_verts Number of nodes defining entity
    //! \param mid_nodes If <em>mid_nodes[i], i=1..2</em> is non-zero, indicates that mid-edge
    //!    (i=1), mid-face (i=2), and/or mid-region (i=3) nodes are likely
    static inline void HasMidNodes( const EntityType this_type, const int num_verts, int mid_nodes[4] );

    //! Same as above, except returns a single integer with the bits, from
    //! least significant to most significant set to one if the corresponding
    //! mid nodes on sub entities of the least dimension (0) to the highest
    //! dimension (3) are present in the elment type.
    static inline int HasMidNodes( const EntityType this_type, const int num_verts );

    //! given data about an element and a vertex in that element, return the dimension
    //! and index of the sub-entity that the vertex resolves.  If it does not resolve a
    //! sub-entity, either because it's a corner node or it's not in the element, -1 is
    //! returned in both return values.
    //! \param elem_type Type of entity being queried
    //! \param num_nodes The number of nodes in the element connectivity
    //! \param ho_node_index The position of the HO node in the connectivity list (zero based)
    //! \param parent_dim Dimension of sub-entity high-order node resolves (returned)
    //! \param parent_index Index of sub-entity high-order node resolves (returned)
    static void HONodeParent( EntityType elem_type, int num_nodes, int ho_node_index, int& parent_dim,
                              int& parent_index );

    //! for an entity of this type with num_verts vertices, and a specified subfacet
    //! (dimension and index), return the index of the higher order node for that entity
    //! in this entity's connectivity array
    //! \param this_type Type of entity being queried
    //! \param num_verts Number of vertices for the entity being queried
    //! \param subfacet_dim Dimension of sub-entity being queried
    //! \param subfacet_index Index of sub-entity being queried
    //! \return index Index of sub-entity's higher-order node
    static short int HONodeIndex( const EntityType this_type, const int num_verts, const int subfacet_dim,
                                  const int subfacet_index );
};

//! get the basis of the numbering system
inline short int CN::GetBasis()
{
    return numberBasis;
}

//! return the connectivity of the specified sub-entity.
inline void CN::SubEntityVertexIndices( const EntityType this_type, const int sub_dimension, const int index,
                                        int sub_entity_conn[] )
{
    EntityType type;
    int n;
    const short* indices = SubEntityVertexIndices( this_type, sub_dimension, index, type, n );
    std::copy( indices, indices + n, sub_entity_conn );
}

inline bool CN::HasMidEdgeNodes( const EntityType this_type, const int num_nodes )
{
    const int bits = HasMidNodes( this_type, num_nodes );
    return static_cast< bool >( ( bits & ( 1 << 1 ) ) >> 1 );
}

inline bool CN::HasMidFaceNodes( const EntityType this_type, const int num_nodes )
{
    const int bits = HasMidNodes( this_type, num_nodes );
    return static_cast< bool >( ( bits & ( 1 << 2 ) ) >> 2 );
}

inline bool CN::HasMidRegionNodes( const EntityType this_type, const int num_nodes )
{
    const int bits = HasMidNodes( this_type, num_nodes );
    return static_cast< bool >( ( bits & ( 1 << 3 ) ) >> 3 );
}

inline int CN::HasMidNodes( const EntityType this_type, const int num_nodes )
{
    assert( (unsigned)num_nodes <= (unsigned)MAX_NODES_PER_ELEMENT );
    return midNodesPerType[this_type][num_nodes];
}

inline void CN::HasMidNodes( const EntityType this_type, const int num_nodes, int mid_nodes[4] )
{
    const int bits = HasMidNodes( this_type, num_nodes );
    mid_nodes[0]   = 0;
    mid_nodes[1]   = ( bits & ( 1 << 1 ) ) >> 1;
    mid_nodes[2]   = ( bits & ( 1 << 2 ) ) >> 2;
    mid_nodes[3]   = ( bits & ( 1 << 3 ) ) >> 3;
}

//! Set permutation or reverse permutation vector
inline void CN::setPermutation( const EntityType t, const int dim, short int* pvec, const int num_entries,
                                const bool is_reverse )
{
    short int *this_vec = permuteVec[t][dim], *that_vec = revPermuteVec[t][dim];
    if( is_reverse )
    {
        this_vec = revPermuteVec[t][dim];
        that_vec = permuteVec[t][dim];
    }

    for( short int i = 0; i < num_entries; i++ )
    {
        this_vec[i]       = pvec[i];
        that_vec[pvec[i]] = i;
    }

    this_vec[MAX_SUB_ENTITIES] = that_vec[MAX_SUB_ENTITIES] = (short)num_entries;
}

//! Reset permutation or reverse permutation vector
inline void CN::resetPermutation( const EntityType t, const int dim )
{
    if( -1 == dim )
    {
        for( unsigned int i = 0; i < 3; i++ )
            resetPermutation( t, i );
        return;
    }

    for( short unsigned int i = 0; i < MAX_SUB_ENTITIES; i++ )
    {
        revPermuteVec[t][dim][i] = permuteVec[t][dim][i] = i;
    }

    revPermuteVec[t][dim][MAX_SUB_ENTITIES] = permuteVec[t][dim][MAX_SUB_ENTITIES] = MAX_SUB_ENTITIES + 1;
}

}  // namespace moab

#endif