 |
Mesh Oriented datABase
(version 5.4.1)
Array-based unstructured mesh datastructure
|
|
Mesh Oriented datABase
(version 5.4.1)
Array-based unstructured mesh datastructure
|
#include <NestedRefine.hpp>
Collaboration diagram for moab::NestedRefine:Classes | |
| struct | codeperf |
| struct | intFEdge |
| Helper. More... | |
| struct | level_memory |
| struct | pmat |
| struct | refPatterns |
| refPatterns More... | |
Public Member Functions | |
| NestedRefine (Core *impl, ParallelComm *comm=0, EntityHandle rset=0) | |
| ~NestedRefine () | |
| ErrorCode | initialize () |
| ErrorCode | generate_mesh_hierarchy (int num_level, int *level_degrees, std::vector< EntityHandle > &level_sets, bool optimize=false) |
| Generate a mesh hierarchy. | |
| ErrorCode | get_connectivity (EntityHandle ent, int level, std::vector< EntityHandle > &conn) |
| Given an entity and its level, return its connectivity. | |
| ErrorCode | get_coordinates (EntityHandle *verts, int num_verts, int level, double *coords) |
| Given a vector of vertices and their level, return its coordinates. | |
| ErrorCode | get_adjacencies (const EntityHandle source_entity, const unsigned int target_dimension, std::vector< EntityHandle > &target_entities) |
| Get the adjacencies associated with an entity. | |
| ErrorCode | child_to_parent (EntityHandle child, int child_level, int parent_level, EntityHandle *parent) |
| ErrorCode | parent_to_child (EntityHandle parent, int parent_level, int child_level, std::vector< EntityHandle > &children) |
| ErrorCode | vertex_to_entities_up (EntityHandle vertex, int vert_level, int parent_level, std::vector< EntityHandle > &incident_entities) |
| ErrorCode | vertex_to_entities_down (EntityHandle vertex, int vert_level, int child_level, std::vector< EntityHandle > &incident_entities) |
| ErrorCode | get_vertex_duplicates (EntityHandle vertex, int level, EntityHandle &dupvertex) |
| bool | is_entity_on_boundary (const EntityHandle &entity) |
| ErrorCode | exchange_ghosts (std::vector< EntityHandle > &lsets, int num_glayers) |
| ErrorCode | update_special_tags (int level, EntityHandle &lset) |
Public Attributes | |
| codeperf | timeall |
Protected Member Functions | |
| int | get_index_from_degree (int degree) |
| ErrorCode | estimate_hm_storage (EntityHandle set, int level_degree, int cur_level, int hmest[4]) |
| ErrorCode | create_hm_storage_single_level (EntityHandle *set, int cur_level, int estL[4]) |
| ErrorCode | generate_hm (int *level_degrees, int num_level, EntityHandle *hm_set, bool optimize) |
| ErrorCode | construct_hm_entities (int cur_level, int deg) |
| ErrorCode | construct_hm_1D (int cur_level, int deg) |
| ErrorCode | construct_hm_1D (int cur_level, int deg, EntityType type, std::vector< EntityHandle > &trackverts) |
| ErrorCode | construct_hm_2D (int cur_level, int deg) |
| ErrorCode | construct_hm_2D (int cur_level, int deg, EntityType type, std::vector< EntityHandle > &trackvertsC_edg, std::vector< EntityHandle > &trackvertsF) |
| ErrorCode | construct_hm_3D (int cur_level, int deg) |
| ErrorCode | subdivide_cells (EntityType type, int cur_level, int deg) |
| ErrorCode | subdivide_tets (int cur_level, int deg) |
| ErrorCode | copy_vertices_from_prev_level (int cur_level) |
| ErrorCode | count_subentities (EntityHandle set, int cur_level, int *nedges, int *nfaces) |
| ErrorCode | get_octahedron_corner_coords (int cur_level, int deg, EntityHandle *vbuffer, double *ocoords) |
| int | find_shortest_diagonal_octahedron (int cur_level, int deg, EntityHandle *vbuffer) |
| int | get_local_vid (EntityHandle vid, EntityHandle ent, int level) |
| ErrorCode | update_tracking_verts (EntityHandle cid, int cur_level, int deg, std::vector< EntityHandle > &trackvertsC_edg, std::vector< EntityHandle > &trackvertsC_face, EntityHandle *vbuffer) |
| ErrorCode | reorder_indices (int cur_level, int deg, EntityHandle cell, int lfid, EntityHandle sib_cell, int sib_lfid, int index, int *id_sib) |
| ErrorCode | reorder_indices (int deg, EntityHandle *face1_conn, EntityHandle *face2_conn, int nvF, std::vector< int > &lemap, std::vector< int > &vidx, int *leorient=NULL) |
| ErrorCode | reorder_indices (int deg, int nvF, int comb, int *childfid_map) |
| ErrorCode | reorder_indices (EntityHandle *face1_conn, EntityHandle *face2_conn, int nvF, int *conn_map, int &comb, int *orient=NULL) |
| ErrorCode | get_lid_inci_child (EntityType type, int deg, int lfid, int leid, std::vector< int > &child_ids, std::vector< int > &child_lvids) |
| ErrorCode | print_maps_1D (int level) |
| ErrorCode | print_maps_2D (int level, EntityType type) |
| ErrorCode | print_maps_3D (int level, EntityType type) |
| ErrorCode | compute_coordinates (int cur_level, int deg, EntityType type, EntityHandle *vbuffer, int vtotal, double *corner_coords, std::vector< int > &vflag, int nverts_prev) |
| ErrorCode | update_local_ahf (int deg, EntityType type, EntityHandle *vbuffer, EntityHandle *ent_buffer, int etotal) |
| ErrorCode | update_local_ahf (int deg, EntityType type, int pat_id, EntityHandle *vbuffer, EntityHandle *ent_buffer, int etotal) |
| ErrorCode | update_global_ahf (EntityType type, int cur_level, int deg, std::vector< int > *pattern_ids=NULL) |
| ErrorCode | update_global_ahf_1D (int cur_level, int deg) |
| ErrorCode | update_global_ahf_1D_sub (int cur_level, int deg) |
| ErrorCode | update_ahf_1D (int cur_level) |
| ErrorCode | update_global_ahf_2D (int cur_level, int deg) |
| ErrorCode | update_global_ahf_2D_sub (int cur_level, int deg) |
| ErrorCode | update_global_ahf_3D (int cur_level, int deg, std::vector< int > *pattern_ids=NULL) |
| bool | is_vertex_on_boundary (const EntityHandle &entity) |
| bool | is_edge_on_boundary (const EntityHandle &entity) |
| bool | is_face_on_boundary (const EntityHandle &entity) |
| bool | is_cell_on_boundary (const EntityHandle &entity) |
Protected Attributes | |
| Core * | mbImpl |
| ParallelComm * | pcomm |
| HalfFacetRep * | ahf |
| CpuTimer * | tm |
| EntityHandle | _rset |
| Range | _inverts |
| Range | _inedges |
| Range | _infaces |
| Range | _incells |
| EntityType | elementype |
| int | meshdim |
| int | nlevels |
| int | level_dsequence [MAX_LEVELS] |
| std::map< int, int > | deg_index |
| bool | hasghost |
| level_memory | level_mesh [MAX_LEVELS] |
Static Protected Attributes | |
| static const refPatterns | refTemplates [9][MAX_DEGREE] |
| refPatterns | |
| static const intFEdge | intFacEdg [2][2] |
| static const pmat | permutation [2] |
Definition at line 34 of file NestedRefine.hpp.
| moab::NestedRefine::NestedRefine | ( | Core * | impl, |
| ParallelComm * | comm = 0, |
||
| EntityHandle | rset = 0 |
||
| ) |
Definition at line 24 of file NestedRefine.cpp.
References moab::error(), ErrorCode, moab::ParallelComm::get_pcomm(), initialize(), MB_SUCCESS, mbImpl, and pcomm.
: mbImpl( impl ), pcomm( comm ), _rset( rset )
{
ErrorCode error;
assert( NULL != impl );
#ifdef MOAB_HAVE_MPI
// Get the Parallel Comm instance to prepare all new sets to work in parallel
// in case the user did not provide any arguments
if( !comm ) pcomm = moab::ParallelComm::get_pcomm( mbImpl, 0 );
#endif
error = initialize();
if( error != MB_SUCCESS )
{
std::cout << "Error initializing NestedRefine\n" << std::endl;
exit( 1 );
}
}
Definition at line 43 of file NestedRefine.cpp.
{
#ifdef MOAB_HAVE_AHF
ahf = NULL;
#else
delete ahf;
#endif
delete tm;
}
| ErrorCode moab::NestedRefine::child_to_parent | ( | EntityHandle | child, |
| int | child_level, | ||
| int | parent_level, | ||
| EntityHandle * | parent | ||
| ) |
Given an entity from a certain level, it returns a pointer to its parent at the requested parent level. NOTE: This query does not support vertices.
| child | EntityHandle of the entity whose parent is requested |
| child_level | Mesh level where the child exists |
| parent_level | Mesh level from which parent is requested |
| parent | Pointer to the parent in the requested parent_level |
Definition at line 234 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, get_index_from_degree(), level_dsequence, level_mesh, MB_SET_ERR, MB_SUCCESS, MBEDGE, MBHEX, mbImpl, MBQUAD, MBTET, MBTRI, MBVERTEX, refTemplates, moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_face, moab::NestedRefine::refPatterns::total_new_ents, and moab::Core::type_from_handle().
Referenced by vertex_to_entities_up().
{
assert( ( child_level > 0 ) && ( child_level > parent_level ) );
EntityType type = mbImpl->type_from_handle( child );
assert( type != MBVERTEX );
int child_index;
if( type == MBEDGE )
child_index = child - level_mesh[child_level - 1].start_edge;
else if( type == MBTRI || type == MBQUAD )
child_index = child - level_mesh[child_level - 1].start_face;
else if( type == MBTET || type == MBHEX )
child_index = child - level_mesh[child_level - 1].start_cell;
else
MB_SET_ERR( MB_FAILURE, "Requesting parent for unsupported entity type" );
int parent_index;
int l = child_level - parent_level;
for( int i = 0; i < l; i++ )
{
int d = get_index_from_degree( level_dsequence[child_level - i - 1] );
int nch = refTemplates[type - 1][d].total_new_ents;
child_index = child_index / nch;
}
parent_index = child_index;
if( type == MBEDGE )
{
if( parent_level > 0 )
*parent = level_mesh[parent_level - 1].start_edge + parent_index;
else
*parent = _inedges[parent_index];
}
else if( type == MBTRI || type == MBQUAD )
{
if( parent_level > 0 )
*parent = level_mesh[parent_level - 1].start_face + parent_index;
else
*parent = _infaces[parent_index];
}
else if( type == MBTET || type == MBHEX )
{
if( parent_level > 0 )
*parent = level_mesh[parent_level - 1].start_cell + parent_index;
else
*parent = _incells[parent_index];
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::compute_coordinates | ( | int | cur_level, |
| int | deg, | ||
| EntityType | type, | ||
| EntityHandle * | vbuffer, | ||
| int | vtotal, | ||
| double * | corner_coords, | ||
| std::vector< int > & | vflag, | ||
| int | nverts_prev | ||
| ) | [protected] |
Definition at line 1730 of file NestedRefine.cpp.
References _incells, _infaces, moab::Range::begin(), moab::NestedRefine::level_memory::coordinates, get_index_from_degree(), level_mesh, MB_SUCCESS, MBHEX, mbImpl, MBPRISM, MBQUAD, MBTET, MBTRI, refTemplates, moab::NestedRefine::level_memory::start_vertex, moab::Core::type_from_handle(), and moab::NestedRefine::refPatterns::vert_nat_coord.
Referenced by construct_hm_2D(), subdivide_cells(), and subdivide_tets().
{
EntityHandle vstart = level_mesh[cur_level].start_vertex;
int d = get_index_from_degree( deg );
if( type == MBTRI )
{
double xi, eta, N[3];
int findex = mbImpl->type_from_handle( *( _infaces.begin() ) ) - 1;
for( int i = 3; i < vtotal; i++ )
{
if( vflag[vbuffer[i] - vstart - nverts_prev] ) continue;
xi = refTemplates[findex][d].vert_nat_coord[i - 3][0];
eta = refTemplates[findex][d].vert_nat_coord[i - 3][1];
N[0] = 1 - xi - eta;
N[1] = xi;
N[2] = eta;
double x = 0, y = 0, z = 0;
for( int j = 0; j < 3; j++ )
{
x += N[j] * corner_coords[3 * j];
y += N[j] * corner_coords[3 * j + 1];
z += N[j] * corner_coords[3 * j + 2];
}
level_mesh[cur_level].coordinates[0][vbuffer[i] - vstart] = x;
level_mesh[cur_level].coordinates[1][vbuffer[i] - vstart] = y;
level_mesh[cur_level].coordinates[2][vbuffer[i] - vstart] = z;
vflag[vbuffer[i] - vstart - nverts_prev] = 1;
}
}
else if( type == MBQUAD )
{
double xi, eta, N[4];
int findex = mbImpl->type_from_handle( *( _infaces.begin() ) ) - 1;
for( int i = 4; i < vtotal; i++ )
{
if( vflag[vbuffer[i] - vstart - nverts_prev] ) continue;
xi = refTemplates[findex][d].vert_nat_coord[i - 4][0];
eta = refTemplates[findex][d].vert_nat_coord[i - 4][1];
N[0] = ( 1 - xi ) * ( 1 - eta ) / 4;
N[1] = ( 1 + xi ) * ( 1 - eta ) / 4;
N[2] = ( 1 + xi ) * ( 1 + eta ) / 4, N[3] = ( 1 - xi ) * ( 1 + eta ) / 4;
double x = 0, y = 0, z = 0;
for( int j = 0; j < 4; j++ )
{
x += N[j] * corner_coords[3 * j];
y += N[j] * corner_coords[3 * j + 1];
z += N[j] * corner_coords[3 * j + 2];
}
level_mesh[cur_level].coordinates[0][vbuffer[i] - vstart] = x;
level_mesh[cur_level].coordinates[1][vbuffer[i] - vstart] = y;
level_mesh[cur_level].coordinates[2][vbuffer[i] - vstart] = z;
vflag[vbuffer[i] - vstart - nverts_prev] = 1;
}
}
else if( type == MBTET )
{
double xi, eta, mu, N[4];
int cindex = mbImpl->type_from_handle( *( _incells.begin() ) ) - 1;
for( int i = 4; i < vtotal; i++ )
{
if( vflag[vbuffer[i] - vstart - nverts_prev] ) continue;
xi = refTemplates[cindex][d].vert_nat_coord[i - 4][0];
eta = refTemplates[cindex][d].vert_nat_coord[i - 4][1];
mu = refTemplates[cindex][d].vert_nat_coord[i - 4][2];
N[0] = 1 - xi - eta - mu;
N[1] = xi;
N[2] = eta, N[3] = mu;
double x = 0, y = 0, z = 0;
for( int j = 0; j < 4; j++ )
{
x += N[j] * corner_coords[3 * j];
y += N[j] * corner_coords[3 * j + 1];
z += N[j] * corner_coords[3 * j + 2];
}
level_mesh[cur_level].coordinates[0][vbuffer[i] - vstart] = x;
level_mesh[cur_level].coordinates[1][vbuffer[i] - vstart] = y;
level_mesh[cur_level].coordinates[2][vbuffer[i] - vstart] = z;
vflag[vbuffer[i] - vstart - nverts_prev] = 1;
}
}
else if( type == MBPRISM )
{
double xi, eta, mu, N[6];
int cindex = mbImpl->type_from_handle( *( _incells.begin() ) ) - 1;
for( int i = 6; i < vtotal; i++ )
{
if( vflag[vbuffer[i] - vstart - nverts_prev] ) continue;
xi = refTemplates[cindex][d].vert_nat_coord[i - 6][0];
eta = refTemplates[cindex][d].vert_nat_coord[i - 6][1];
mu = refTemplates[cindex][d].vert_nat_coord[i - 6][2];
N[0] = ( 1 - xi - eta ) * ( 1 - mu ), N[1] = xi * ( 1 - mu ), N[2] = eta * ( 1 - mu ),
N[3] = ( 1 - xi - eta ) * ( 1 + mu ), N[4] = xi * ( 1 + mu ), N[5] = eta * ( 1 + mu );
double x = 0, y = 0, z = 0;
for( int j = 0; j < 6; j++ )
{
x += N[j] * corner_coords[3 * j];
y += N[j] * corner_coords[3 * j + 1];
z += N[j] * corner_coords[3 * j + 2];
}
level_mesh[cur_level].coordinates[0][vbuffer[i] - vstart] = x;
level_mesh[cur_level].coordinates[1][vbuffer[i] - vstart] = y;
level_mesh[cur_level].coordinates[2][vbuffer[i] - vstart] = z;
vflag[vbuffer[i] - vstart - nverts_prev] = 1;
}
}
else if( type == MBHEX )
{
double xi, eta, mu, N[8];
double d1, d2, d3, s1, s2, s3;
int cindex = mbImpl->type_from_handle( *( _incells.begin() ) ) - 1;
for( int i = 8; i < vtotal; i++ )
{
if( vflag[vbuffer[i] - vstart - nverts_prev] ) continue;
xi = refTemplates[cindex][d].vert_nat_coord[i - 8][0];
eta = refTemplates[cindex][d].vert_nat_coord[i - 8][1];
mu = refTemplates[cindex][d].vert_nat_coord[i - 8][2];
d1 = 1 - xi;
d2 = 1 - eta;
d3 = 1 - mu;
s1 = 1 + xi;
s2 = 1 + eta;
s3 = 1 + mu;
N[0] = ( d1 * d2 * d3 ) / 8;
N[1] = ( s1 * d2 * d3 ) / 8;
N[2] = ( s1 * s2 * d3 ) / 8;
N[3] = ( d1 * s2 * d3 ) / 8;
N[4] = ( d1 * d2 * s3 ) / 8;
N[5] = ( s1 * d2 * s3 ) / 8;
N[6] = ( s1 * s2 * s3 ) / 8;
N[7] = ( d1 * s2 * s3 ) / 8;
double x = 0, y = 0, z = 0;
for( int j = 0; j < 8; j++ )
{
x += N[j] * corner_coords[3 * j];
y += N[j] * corner_coords[3 * j + 1];
z += N[j] * corner_coords[3 * j + 2];
}
level_mesh[cur_level].coordinates[0][vbuffer[i] - vstart] = x;
level_mesh[cur_level].coordinates[1][vbuffer[i] - vstart] = y;
level_mesh[cur_level].coordinates[2][vbuffer[i] - vstart] = z;
vflag[vbuffer[i] - vstart - nverts_prev] = 1;
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::construct_hm_1D | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 804 of file NestedRefine.cpp.
References _inedges, _inverts, moab::Range::begin(), moab::NestedRefine::level_memory::coordinates, moab::NestedRefine::level_memory::edge_conn, moab::NestedRefine::refPatterns::ents_conn, moab::error(), ErrorCode, get_connectivity(), get_index_from_degree(), moab::Range::index(), level_mesh, MB_CHK_ERR, MB_SUCCESS, MBEDGE, moab::NestedRefine::level_memory::num_edges, moab::NestedRefine::level_memory::num_verts, refTemplates, moab::Range::size(), moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::NestedRefine::refPatterns::total_new_verts, update_global_ahf(), update_local_ahf(), and moab::NestedRefine::refPatterns::vert_nat_coord.
Referenced by construct_hm_2D(), construct_hm_entities(), subdivide_cells(), and subdivide_tets().
{
ErrorCode error;
int nverts_prev, nents_prev;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_edges;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _inedges.size();
}
int d = get_index_from_degree( deg );
int vtotal = 2 + refTemplates[0][d].total_new_verts;
std::vector< EntityHandle > vbuffer( vtotal );
std::vector< EntityHandle > conn;
int count_nents = 0;
int count_verts = nverts_prev;
// Step 1: Create the subentities via refinement of the previous mesh
for( int eid = 0; eid < nents_prev; eid++ )
{
conn.clear();
// EntityHandle of the working edge
EntityHandle edge;
if( cur_level )
edge = level_mesh[cur_level - 1].start_edge + eid;
else
edge = _inedges[eid]; // Makes the assumption initial mesh is contiguous in memory
error = get_connectivity( edge, cur_level, conn );MB_CHK_ERR( error );
// Add the vertex handles to vbuffer for the current level for the working edge
// Since the old vertices are copied first, their local indices do not change as new levels
// are added. Clearly the local indices of the new vertices introduced in the current level
// is still the same when the old vertices are copied. Thus, there is no need to explicitly
// store another map between the old and duplicates in the subsequent levels. The second
// part in the following sum is the local index in the previous level.
// Add the corners to the vbuffer first.
for( int i = 0; i < (int)conn.size(); i++ )
{
if( cur_level )
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - level_mesh[cur_level - 1].start_vertex );
else
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - *_inverts.begin() );
}
// Adding rest of the entityhandles to working buffer for vertices.
int num_new_verts = refTemplates[0][d].total_new_verts;
for( int i = 0; i < num_new_verts; i++ )
{
vbuffer[i + 2] = level_mesh[cur_level].start_vertex + count_verts;
count_verts += 1;
}
// Use the template to obtain the subentities
int id1, id2;
int etotal = refTemplates[0][d].total_new_ents;
std::vector< EntityHandle > ent_buffer( etotal );
for( int i = 0; i < etotal; i++ )
{
id1 = refTemplates[0][d].ents_conn[i][0];
id2 = refTemplates[0][d].ents_conn[i][1];
level_mesh[cur_level].edge_conn[2 * ( count_nents )] = vbuffer[id1];
level_mesh[cur_level].edge_conn[2 * ( count_nents ) + 1] = vbuffer[id2];
ent_buffer[i] = level_mesh[cur_level].start_edge + count_nents;
count_nents += 1;
};
error = update_local_ahf( deg, MBEDGE, &vbuffer[0], &ent_buffer[0], etotal );MB_CHK_ERR( error );
// Compute the coordinates of the new vertices: Linear interpolation
int idx;
double xi;
for( int i = 0; i < num_new_verts; i++ )
{
xi = refTemplates[0][d].vert_nat_coord[i][0];
idx = vbuffer[i + 2] - level_mesh[cur_level].start_vertex; // index of new vertex in current level
if( cur_level )
{
id1 = conn[0] - level_mesh[cur_level - 1].start_vertex; // index of old end vertices in current level
id2 = conn[1] - level_mesh[cur_level - 1].start_vertex;
}
else
{
id1 = _inverts.index( conn[0] );
id2 = _inverts.index( conn[1] );
}
level_mesh[cur_level].coordinates[0][idx] =
( 1 - xi ) * level_mesh[cur_level].coordinates[0][id1] + xi * level_mesh[cur_level].coordinates[0][id2];
level_mesh[cur_level].coordinates[1][idx] =
( 1 - xi ) * level_mesh[cur_level].coordinates[1][id1] + xi * level_mesh[cur_level].coordinates[1][id2];
level_mesh[cur_level].coordinates[2][idx] =
( 1 - xi ) * level_mesh[cur_level].coordinates[2][id1] + xi * level_mesh[cur_level].coordinates[2][id2];
}
}
error = update_global_ahf( MBEDGE, cur_level, deg );MB_CHK_ERR( error );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::construct_hm_1D | ( | int | cur_level, |
| int | deg, | ||
| EntityType | type, | ||
| std::vector< EntityHandle > & | trackverts | ||
| ) | [protected] |
Definition at line 917 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, _inverts, ahf, moab::Range::begin(), dim, moab::HalfFacetRep::LocalMaps3D::e2v, moab::NestedRefine::level_memory::edge_conn, moab::NestedRefine::refPatterns::ents_conn, moab::error(), ErrorCode, get_connectivity(), get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_up_adjacencies_2d(), moab::HalfFacetRep::get_up_adjacencies_edg_3d(), moab::Range::index(), moab::HalfFacetRep::lConnMap2D, moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SUCCESS, MBEDGE, MBHEX, MBQUAD, MBTET, MBTRI, moab::HalfFacetRep::LocalMaps2D::next, moab::NestedRefine::level_memory::num_edges, moab::HalfFacetRep::LocalMaps3D::num_edges_in_cell, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, moab::NestedRefine::refPatterns::nv_edge, refTemplates, moab::Range::size(), moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_face, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::NestedRefine::refPatterns::total_new_verts, update_global_ahf_1D_sub(), and update_local_ahf().
{
ErrorCode error;
int nedges_prev;
if( cur_level )
nedges_prev = level_mesh[cur_level - 1].num_edges;
else
nedges_prev = _inedges.size();
int d = get_index_from_degree( deg );
int nve = refTemplates[0][d].nv_edge;
int vtotal = 2 + refTemplates[0][d].total_new_verts;
int etotal = refTemplates[0][d].total_new_ents;
int ne = 0, dim = 0, index = 0;
if( type == MBTRI || type == MBQUAD )
{
index = type - 2;
ne = ahf->lConnMap2D[index].num_verts_in_face;
dim = 2;
}
else if( type == MBTET || type == MBHEX )
{
index = ahf->get_index_in_lmap( *( _incells.begin() ) );
ne = ahf->lConnMap3D[index].num_edges_in_cell;
dim = 3;
}
std::vector< EntityHandle > vbuffer( vtotal );
std::vector< EntityHandle > ent_buffer( etotal );
std::vector< EntityHandle > adjents, econn, fconn;
std::vector< int > leids;
int count_nents = 0;
// Loop over all the edges and gather the vertices to be used for refinement
for( int eid = 0; eid < nedges_prev; eid++ )
{
adjents.clear();
leids.clear();
econn.clear();
fconn.clear();
for( int i = 0; i < vtotal; i++ )
vbuffer[i] = 0;
for( int i = 0; i < etotal; i++ )
ent_buffer[i] = 0;
EntityHandle edge;
if( cur_level )
edge = level_mesh[cur_level - 1].start_edge + eid;
else
edge = _inedges[eid];
error = get_connectivity( edge, cur_level, econn );MB_CHK_ERR( error );
for( int i = 0; i < (int)econn.size(); i++ )
{
if( cur_level )
vbuffer[i] = level_mesh[cur_level].start_vertex + ( econn[i] - level_mesh[cur_level - 1].start_vertex );
else
vbuffer[i] = level_mesh[cur_level].start_vertex + ( econn[i] - *_inverts.begin() );
}
int fid = -1, lid = -1, idx1 = -1, idx2 = -1;
if( dim == 2 )
{
error = ahf->get_up_adjacencies_2d( edge, adjents, &leids );MB_CHK_ERR( error );
if( cur_level )
fid = adjents[0] - level_mesh[cur_level - 1].start_face;
else
fid = _infaces.index( adjents[0] );
lid = leids[0];
idx1 = lid;
idx2 = ahf->lConnMap2D[index].next[lid];
}
else if( dim == 3 )
{
error = ahf->get_up_adjacencies_edg_3d( edge, adjents, &leids );MB_CHK_ERR( error );
if( cur_level )
fid = adjents[0] - level_mesh[cur_level - 1].start_cell;
else
fid = _incells.index( adjents[0] );
lid = leids[0];
idx1 = ahf->lConnMap3D[index].e2v[lid][0];
idx2 = ahf->lConnMap3D[index].e2v[lid][1];
}
error = get_connectivity( adjents[0], cur_level, fconn );MB_CHK_ERR( error );
bool orient = false;
if( ( fconn[idx1] == econn[0] ) && ( fconn[idx2] == econn[1] ) ) orient = true;
if( orient )
{
for( int j = 0; j < nve; j++ )
vbuffer[j + 2] = trackverts[fid * ne * nve + nve * lid + j];
}
else
{
for( int j = 0; j < nve; j++ )
vbuffer[( nve - j - 1 ) + 2] = trackverts[fid * ne * nve + nve * lid + j];
}
// Use the template to obtain the subentities
int id1, id2;
for( int i = 0; i < etotal; i++ )
{
id1 = refTemplates[0][d].ents_conn[i][0];
id2 = refTemplates[0][d].ents_conn[i][1];
level_mesh[cur_level].edge_conn[2 * ( count_nents )] = vbuffer[id1];
level_mesh[cur_level].edge_conn[2 * ( count_nents ) + 1] = vbuffer[id2];
ent_buffer[i] = level_mesh[cur_level].start_edge + count_nents;
count_nents += 1;
};
error = update_local_ahf( deg, MBEDGE, &vbuffer[0], &ent_buffer[0], etotal );MB_CHK_ERR( error );
}
error = update_global_ahf_1D_sub( cur_level, deg );MB_CHK_ERR( error );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::construct_hm_2D | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 1048 of file NestedRefine.cpp.
References _inedges, _infaces, _inverts, ahf, moab::Range::begin(), compute_coordinates(), construct_hm_1D(), moab::Range::empty(), moab::NestedRefine::refPatterns::ents_conn, moab::error(), ErrorCode, moab::NestedRefine::level_memory::face_conn, get_connectivity(), get_coordinates(), get_index_from_degree(), moab::HalfFacetRep::get_up_adjacencies_2d(), moab::HalfFacetRep::lConnMap2D, level_mesh, MB_CHK_ERR, MB_SUCCESS, mbImpl, moab::NestedRefine::level_memory::num_faces, moab::NestedRefine::level_memory::num_verts, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, moab::NestedRefine::refPatterns::nv_edge, refTemplates, moab::Range::size(), moab::NestedRefine::level_memory::start_face, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::NestedRefine::refPatterns::total_new_verts, moab::Core::type_from_handle(), update_global_ahf(), update_local_ahf(), and moab::NestedRefine::refPatterns::vert_on_edges.
Referenced by construct_hm_entities(), subdivide_cells(), and subdivide_tets().
{
ErrorCode error;
int nverts_prev, nents_prev;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_faces;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _infaces.size();
}
// Create some book-keeping arrays over the old mesh to avoid introducing duplicate vertices and
// calculating vertices more than once.
EntityType ftype = mbImpl->type_from_handle( *_infaces.begin() );
int nepf = ahf->lConnMap2D[ftype - 2].num_verts_in_face;
int findex = ftype - 1;
int d = get_index_from_degree( deg );
int tnv = refTemplates[findex][d].total_new_verts;
int vtotal = nepf + tnv;
std::vector< EntityHandle > vbuffer( vtotal );
int etotal = refTemplates[findex][d].total_new_ents;
std::vector< EntityHandle > ent_buffer( etotal );
int nve = refTemplates[findex][d].nv_edge;
std::vector< EntityHandle > trackvertsF( nents_prev * nepf * nve, 0 );
int cur_nverts = level_mesh[cur_level].num_verts;
std::vector< int > flag_verts( cur_nverts - nverts_prev, 0 );
int count_nverts = nverts_prev;
int count_nents = 0;
std::vector< EntityHandle > conn, cur_conn;
// Step 1: Create the subentities via refinement of the previous mesh
for( int fid = 0; fid < nents_prev; fid++ )
{
conn.clear();
cur_conn.clear();
for( int i = 0; i < vtotal; i++ )
vbuffer[i] = 0;
for( int i = 0; i < etotal; i++ )
ent_buffer[i] = 0;
// EntityHandle of the working face
EntityHandle face;
if( cur_level )
face = level_mesh[cur_level - 1].start_face + fid;
else
face = _infaces[fid];
error = get_connectivity( face, cur_level, conn );MB_CHK_ERR( error );
// Step 1: Add vertices from the current level for the working face that will be used for
// subdivision.
// Add the corners to vbuffer
for( int i = 0; i < (int)conn.size(); i++ )
{
if( cur_level )
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - level_mesh[cur_level - 1].start_vertex );
else
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - *_inverts.begin() );
cur_conn.push_back( vbuffer[i] );
}
// Gather vertices already added to tracking array due to refinement of the sibling faces
for( int i = 0; i < nepf; i++ )
{
for( int j = 0; j < nve; j++ )
{
int id = refTemplates[findex][d].vert_on_edges[i][j];
vbuffer[id] = trackvertsF[fid * nve * nepf + nve * i + j];
}
}
// Add the remaining vertex handles to vbuffer for the current level for the working face
for( int i = 0; i < tnv; i++ )
{
if( !vbuffer[i + nepf] )
{
vbuffer[i + nepf] = level_mesh[cur_level].start_vertex + count_nverts;
count_nverts += 1;
}
}
// Step 2: Create the subentities using the template and the vbuffer
int idx;
for( int i = 0; i < etotal; i++ )
{
for( int k = 0; k < nepf; k++ )
{
idx = refTemplates[findex][d].ents_conn[i][k];
level_mesh[cur_level].face_conn[nepf * count_nents + k] = vbuffer[idx];
}
ent_buffer[i] = level_mesh[cur_level].start_face + count_nents;
count_nents += 1;
}
// Step 3: Update the local AHF maps
error = update_local_ahf( deg, ftype, &vbuffer[0], &ent_buffer[0], etotal );MB_CHK_ERR( error );
// Step 4: Add the new vertices to the tracking array
int id;
for( int i = 0; i < nepf; i++ )
{
// Add the vertices to trackvertsF for fid
for( int j = 0; j < nve; j++ )
{
id = refTemplates[findex][d].vert_on_edges[i][j];
trackvertsF[fid * nepf * nve + nve * i + j] = vbuffer[id];
}
std::vector< EntityHandle > sibfids;
std::vector< int > sibleids;
std::vector< int > siborient;
// Add the vertices to trackvertsF for siblings of fid, if any.
error = ahf->get_up_adjacencies_2d( face, i, false, sibfids, &sibleids, &siborient );MB_CHK_ERR( error );
if( !sibfids.size() ) continue;
for( int s = 0; s < (int)sibfids.size(); s++ )
{
int sibid;
if( cur_level )
sibid = sibfids[s] - level_mesh[cur_level - 1].start_face;
else
sibid = sibfids[s] - *_infaces.begin();
if( siborient[s] ) // Same half-edge direction as the current half-edge
{
for( int j = 0; j < nve; j++ )
{
id = refTemplates[findex][d].vert_on_edges[i][j];
trackvertsF[sibid * nepf * nve + nve * sibleids[s] + j] = vbuffer[id];
}
}
else
{
for( int j = 0; j < nve; j++ )
{
id = refTemplates[findex][d].vert_on_edges[i][nve - j - 1];
trackvertsF[sibid * nepf * nve + nve * sibleids[s] + j] = vbuffer[id];
}
}
}
}
// Step 5: Compute the coordinates of the new vertices, avoids computing more than once via
// the flag_verts array.
std::vector< double > corner_coords( nepf * 3 );
error = get_coordinates( &cur_conn[0], nepf, cur_level + 1, &corner_coords[0] );MB_CHK_ERR( error );
error = compute_coordinates( cur_level, deg, ftype, &vbuffer[0], vtotal, &corner_coords[0], flag_verts,
nverts_prev );MB_CHK_ERR( error );
}
// Step 6: Update the global maps
error = update_global_ahf( ftype, cur_level, deg );MB_CHK_ERR( error );
// Step 7: If edges exists, refine them.
if( !_inedges.empty() )
{
error = construct_hm_1D( cur_level, deg, ftype, trackvertsF );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::construct_hm_2D | ( | int | cur_level, |
| int | deg, | ||
| EntityType | type, | ||
| std::vector< EntityHandle > & | trackvertsC_edg, | ||
| std::vector< EntityHandle > & | trackvertsF | ||
| ) | [protected] |
Definition at line 1223 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, _inverts, ahf, moab::Range::begin(), moab::HalfFacetRep::LocalMaps3D::e2v, moab::NestedRefine::level_memory::edge_conn, moab::NestedRefine::refPatterns::ents_conn, moab::error(), ErrorCode, moab::HalfFacetRep::LocalMaps3D::f2leid, moab::NestedRefine::level_memory::face_conn, get_connectivity(), get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_up_adjacencies_face_3d(), moab::HalfFacetRep::LocalMaps3D::hf2v, moab::NestedRefine::intFEdge::ieconn, moab::Range::index(), intFacEdg, moab::HalfFacetRep::lConnMap2D, moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SUCCESS, MBEDGE, MBHEX, MBQUAD, MBTRI, moab::HalfFacetRep::LocalMaps2D::next, moab::NestedRefine::intFEdge::nie, moab::NestedRefine::level_memory::num_edges, moab::HalfFacetRep::LocalMaps3D::num_edges_in_cell, moab::NestedRefine::level_memory::num_faces, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, moab::NestedRefine::refPatterns::nv_edge, moab::NestedRefine::refPatterns::nv_face, refTemplates, reorder_indices(), moab::Range::size(), moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_face, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::NestedRefine::refPatterns::total_new_verts, update_ahf_1D(), update_global_ahf_2D_sub(), update_local_ahf(), moab::NestedRefine::refPatterns::vert_on_edges, and moab::NestedRefine::refPatterns::vert_on_faces.
{
ErrorCode error;
EntityType ftype = MBTRI;
if( type == MBHEX ) ftype = MBQUAD;
int d = get_index_from_degree( deg );
int findex = ftype - 1;
int cidx = ahf->get_index_in_lmap( *( _incells.begin() ) );
int nepf = ahf->lConnMap2D[ftype - 2].num_verts_in_face;
int nepc = ahf->lConnMap3D[cidx].num_edges_in_cell;
int nfpc = ahf->lConnMap3D[cidx].num_faces_in_cell;
int tnv = refTemplates[findex][d].total_new_verts;
int nve = refTemplates[findex][d].nv_edge;
int nvf = refTemplates[findex][d].nv_face;
int vtotal = nepf + tnv;
int etotal = refTemplates[findex][d].total_new_ents;
std::vector< EntityHandle > vbuffer( vtotal );
std::vector< EntityHandle > ent_buffer( etotal );
std::vector< EntityHandle > adjents, fconn, cconn;
std::vector< int > leids;
int count_nents = 0;
int nents_prev, ecount;
if( cur_level )
{
nents_prev = level_mesh[cur_level - 1].num_faces;
ecount = level_mesh[cur_level - 1].num_edges * refTemplates[MBEDGE - 1][d].total_new_ents;
;
}
else
{
nents_prev = _infaces.size();
ecount = _inedges.size() * refTemplates[MBEDGE - 1][d].total_new_ents;
;
}
// Step 1: Create the subentities via refinement of the previous mesh
for( int it = 0; it < nents_prev; it++ )
{
fconn.clear();
cconn.clear();
adjents.clear();
leids.clear();
for( int i = 0; i < vtotal; i++ )
vbuffer[i] = 0;
for( int i = 0; i < etotal; i++ )
ent_buffer[i] = 0;
// EntityHandle of the working face
EntityHandle face;
if( cur_level )
face = level_mesh[cur_level - 1].start_face + it;
else
face = _infaces[it];
error = get_connectivity( face, cur_level, fconn );MB_CHK_ERR( error );
// Add the new handles for old connectivity in the buffer
for( int i = 0; i < (int)fconn.size(); i++ )
{
if( cur_level )
vbuffer[i] = level_mesh[cur_level].start_vertex + ( fconn[i] - level_mesh[cur_level - 1].start_vertex );
else
vbuffer[i] = level_mesh[cur_level].start_vertex + ( fconn[i] - *_inverts.begin() );
}
// Add handles for vertices on edges and faces from the already refined cell
int fid, lid;
error = ahf->get_up_adjacencies_face_3d( face, adjents, &leids );MB_CHK_ERR( error );
if( cur_level )
fid = adjents[0] - level_mesh[cur_level - 1].start_cell;
else
fid = _incells.index( adjents[0] );
lid = leids[0];
error = get_connectivity( adjents[0], cur_level, cconn );MB_CHK_ERR( error );
// Find the orientation w.r.t the half-face and then add vertices properly.
std::vector< EntityHandle > fac_conn( nepf );
std::vector< EntityHandle > lfac_conn( nepf );
for( int j = 0; j < nepf; j++ )
{
fac_conn[j] = fconn[j];
int id = ahf->lConnMap3D[cidx].hf2v[lid][j];
lfac_conn[j] = cconn[id];
}
std::vector< int > le_idx, indices;
error = reorder_indices( deg, &fac_conn[0], &lfac_conn[0], nepf, le_idx, indices );MB_CHK_ERR( error );
// Add the existing vertices on edges of the already refined cell to the vbuffer
for( int j = 0; j < nepf; j++ )
{
int id = le_idx[j]; // Corresponding local edge
int idx = ahf->lConnMap3D[cidx].f2leid[lid][id]; // Local edge in the cell
// Get the orientation of the local edge of the face wrt the corresponding local edge in
// the cell
bool eorient = false;
int fnext = ahf->lConnMap2D[ftype - 2].next[j];
int idx1 = ahf->lConnMap3D[cidx].e2v[idx][0];
int idx2 = ahf->lConnMap3D[cidx].e2v[idx][1];
if( ( fconn[j] == cconn[idx1] ) && ( fconn[fnext] == cconn[idx2] ) ) eorient = true;
if( eorient )
{
for( int k = 0; k < nve; k++ )
{
int ind = refTemplates[findex][d].vert_on_edges[j][k];
vbuffer[ind] = trackvertsE[fid * nepc * nve + nve * idx + k];
}
}
else
{
for( int k = 0; k < nve; k++ )
{
int ind = refTemplates[findex][d].vert_on_edges[j][nve - k - 1];
vbuffer[ind] = trackvertsE[fid * nepc * nve + nve * idx + k];
}
}
}
// Add the existing vertices on the face of the refine cell to vbuffer
if( nvf )
{
for( int k = 0; k < nvf; k++ )
{
int ind = refTemplates[findex][d].vert_on_faces[0][k];
vbuffer[ind] = trackvertsF[fid * nfpc * nvf + nvf * lid + indices[k] - 1];
}
}
// Create the subentities using the template and the vbuffer
for( int i = 0; i < etotal; i++ )
{
for( int k = 0; k < nepf; k++ )
{
int idx = refTemplates[findex][d].ents_conn[i][k];
level_mesh[cur_level].face_conn[nepf * count_nents + k] = vbuffer[idx];
}
ent_buffer[i] = level_mesh[cur_level].start_face + count_nents;
count_nents += 1;
}
error = update_local_ahf( deg, ftype, &vbuffer[0], &ent_buffer[0], etotal );MB_CHK_ERR( error );
// Create the interior edges
int id1, id2;
int ne = intFacEdg[ftype - 2][d].nie;
for( int i = 0; i < ne; i++ )
{
id1 = intFacEdg[ftype - 2][d].ieconn[i][0];
id2 = intFacEdg[ftype - 2][d].ieconn[i][1];
level_mesh[cur_level].edge_conn[2 * ( ecount )] = vbuffer[id1];
level_mesh[cur_level].edge_conn[2 * ( ecount ) + 1] = vbuffer[id2];
ecount += 1;
}
}
// Step 6: Update the global maps
error = update_global_ahf_2D_sub( cur_level, deg );MB_CHK_ERR( error );
// Step 7: Update the hf-maps for the edges
error = update_ahf_1D( cur_level );MB_CHK_ERR( error );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::construct_hm_3D | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 1405 of file NestedRefine.cpp.
References _incells, moab::Range::begin(), moab::error(), ErrorCode, MB_CHK_ERR, MB_SUCCESS, mbImpl, MBTET, subdivide_cells(), subdivide_tets(), and moab::Core::type_from_handle().
Referenced by construct_hm_entities().
{
ErrorCode error;
EntityType type = mbImpl->type_from_handle( *( _incells.begin() ) );
if( type == MBTET )
{
error = subdivide_tets( cur_level, deg );MB_CHK_ERR( error );
}
else
{
error = subdivide_cells( type, cur_level, deg );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::construct_hm_entities | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 783 of file NestedRefine.cpp.
References ahf, construct_hm_1D(), construct_hm_2D(), construct_hm_3D(), moab::CURVE, moab::error(), ErrorCode, MB_CHK_ERR, MB_SUCCESS, moab::SURFACE, moab::SURFACE_MIXED, and moab::HalfFacetRep::thismeshtype.
Referenced by generate_hm().
{
ErrorCode error;
// Generate mesh for current level by refining previous level.
if( ahf->thismeshtype == CURVE )
{
error = construct_hm_1D( cur_level, deg );MB_CHK_ERR( error );
}
else if( ahf->thismeshtype == SURFACE || ahf->thismeshtype == SURFACE_MIXED )
{
error = construct_hm_2D( cur_level, deg );MB_CHK_ERR( error );
}
else
{
error = construct_hm_3D( cur_level, deg );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::copy_vertices_from_prev_level | ( | int | cur_level | ) | [protected] |
Definition at line 4165 of file NestedRefine.cpp.
References _inverts, moab::NestedRefine::level_memory::coordinates, moab::error(), ErrorCode, moab::Core::get_coords(), level_mesh, MB_CHK_ERR, MB_SUCCESS, mbImpl, moab::NestedRefine::level_memory::num_verts, and moab::Range::size().
Referenced by generate_hm().
{
ErrorCode error;
if( cur_level )
{
int nverts_prev = level_mesh[cur_level - 1].num_verts;
for( int i = 0; i < nverts_prev; i++ )
{
level_mesh[cur_level].coordinates[0][i] = level_mesh[cur_level - 1].coordinates[0][i];
level_mesh[cur_level].coordinates[1][i] = level_mesh[cur_level - 1].coordinates[1][i];
level_mesh[cur_level].coordinates[2][i] = level_mesh[cur_level - 1].coordinates[2][i];
}
}
else // Copy the vertices from the input mesh
{
int nverts_in = _inverts.size();
std::vector< double > vcoords( 3 * nverts_in );
error = mbImpl->get_coords( _inverts, &vcoords[0] );MB_CHK_ERR( error );
for( int i = 0; i < nverts_in; i++ )
{
level_mesh[cur_level].coordinates[0][i] = vcoords[3 * i];
level_mesh[cur_level].coordinates[1][i] = vcoords[3 * i + 1];
level_mesh[cur_level].coordinates[2][i] = vcoords[3 * i + 2];
}
}
return MB_SUCCESS;
// To add: Map from old vertices to new duplicates: NOT NEEDED
}
| ErrorCode moab::NestedRefine::count_subentities | ( | EntityHandle | set, |
| int | cur_level, | ||
| int * | nedges, | ||
| int * | nfaces | ||
| ) | [protected] |
Definition at line 4520 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, ahf, moab::HalfFacetRep::count_subentities(), moab::error(), ErrorCode, moab::Core::get_entities_by_dimension(), MB_CHK_ERR, MB_SUCCESS, and mbImpl.
Referenced by estimate_hm_storage().
{
ErrorCode error;
if( cur_level >= 0 )
{
Range edges, faces, cells;
error = mbImpl->get_entities_by_dimension( set, 1, edges );MB_CHK_ERR( error );
error = mbImpl->get_entities_by_dimension( set, 2, faces );MB_CHK_ERR( error );
error = mbImpl->get_entities_by_dimension( set, 3, cells );MB_CHK_ERR( error );
error = ahf->count_subentities( edges, faces, cells, nedges, nfaces );MB_CHK_ERR( error );
}
else
{
error = ahf->count_subentities( _inedges, _infaces, _incells, nedges, nfaces );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::create_hm_storage_single_level | ( | EntityHandle * | set, |
| int | cur_level, | ||
| int | estL[4] | ||
| ) | [protected] |
Definition at line 624 of file NestedRefine.cpp.
References _incells, _infaces, moab::Core::add_entities(), ahf, moab::ReadUtilIface::assign_ids(), moab::Range::begin(), moab::NestedRefine::level_memory::cells, moab::Core::create_meshset(), moab::NestedRefine::level_memory::edges, moab::error(), ErrorCode, moab::NestedRefine::level_memory::faces, moab::ReadUtilIface::get_element_connect(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_mesh_type(), moab::ReadUtilIface::get_node_coords(), GLOBAL_ID_TAG_NAME, moab::HalfFacetRep::lConnMap2D, moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_CHK_SET_ERR, MB_SUCCESS, MBEDGE, mbImpl, MESHSET_SET, moab::NestedRefine::level_memory::num_cells, moab::NestedRefine::level_memory::num_edges, moab::NestedRefine::level_memory::num_faces, moab::NestedRefine::level_memory::num_verts, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, moab::Interface::query_interface(), moab::HalfFacetRep::resize_hf_maps(), moab::Core::tag_get_handle(), moab::HalfFacetRep::thismeshtype, moab::Core::type_from_handle(), moab::HalfFacetRep::update_entity_ranges(), and moab::NestedRefine::level_memory::verts.
Referenced by generate_hm().
{
// Obtain chunks of memory for the current level. Add them to a particular meshset.
EntityHandle set_handle;
ErrorCode error = mbImpl->create_meshset( MESHSET_SET, set_handle );MB_CHK_SET_ERR( error, "Cannot create mesh for the current level" );
*set = set_handle;
ReadUtilIface* read_iface;
error = mbImpl->query_interface( read_iface );MB_CHK_ERR( error );
// Vertices
error = read_iface->get_node_coords( 3, estL[0], 0, level_mesh[cur_level].start_vertex,
level_mesh[cur_level].coordinates );MB_CHK_ERR( error );
level_mesh[cur_level].num_verts = estL[0];
Range newverts( level_mesh[cur_level].start_vertex, level_mesh[cur_level].start_vertex + estL[0] - 1 );
error = mbImpl->add_entities( *set, newverts );MB_CHK_ERR( error );
level_mesh[cur_level].verts = newverts;
Tag gidtag;
error = mbImpl->tag_get_handle( GLOBAL_ID_TAG_NAME, gidtag );MB_CHK_ERR( error );
error = read_iface->assign_ids( gidtag, newverts, level_mesh[cur_level].start_vertex );MB_CHK_ERR( error );
// Edges
if( estL[1] )
{
error = read_iface->get_element_connect( estL[1], 2, MBEDGE, 0, level_mesh[cur_level].start_edge,
level_mesh[cur_level].edge_conn );MB_CHK_ERR( error );
level_mesh[cur_level].num_edges = estL[1];
Range newedges( level_mesh[cur_level].start_edge, level_mesh[cur_level].start_edge + estL[1] - 1 );
error = mbImpl->add_entities( *set, newedges );MB_CHK_ERR( error );
level_mesh[cur_level].edges = newedges;
}
else
level_mesh[cur_level].num_edges = 0;
// Faces
if( estL[2] )
{
EntityType type = mbImpl->type_from_handle( *( _infaces.begin() ) );
int nvpf = ahf->lConnMap2D[type - 2].num_verts_in_face;
error = read_iface->get_element_connect( estL[2], nvpf, type, 0, level_mesh[cur_level].start_face,
level_mesh[cur_level].face_conn );MB_CHK_ERR( error );
level_mesh[cur_level].num_faces = estL[2];
Range newfaces( level_mesh[cur_level].start_face, level_mesh[cur_level].start_face + estL[2] - 1 );
error = mbImpl->add_entities( *set, newfaces );MB_CHK_ERR( error );
level_mesh[cur_level].faces = newfaces;
}
else
level_mesh[cur_level].num_faces = 0;
// Cells
if( estL[3] )
{
EntityType type = mbImpl->type_from_handle( *( _incells.begin() ) );
int index = ahf->get_index_in_lmap( *_incells.begin() );
int nvpc = ahf->lConnMap3D[index].num_verts_in_cell;
error = read_iface->get_element_connect( estL[3], nvpc, type, 0, level_mesh[cur_level].start_cell,
level_mesh[cur_level].cell_conn );MB_CHK_ERR( error );
level_mesh[cur_level].num_cells = estL[3];
Range newcells( level_mesh[cur_level].start_cell, level_mesh[cur_level].start_cell + estL[3] - 1 );
error = mbImpl->add_entities( *set, newcells );MB_CHK_ERR( error );
level_mesh[cur_level].cells = newcells;
}
else
level_mesh[cur_level].num_cells = 0;
// Resize the ahf maps
error = ahf->resize_hf_maps( level_mesh[cur_level].start_vertex, level_mesh[cur_level].num_verts,
level_mesh[cur_level].start_edge, level_mesh[cur_level].num_edges,
level_mesh[cur_level].start_face, level_mesh[cur_level].num_faces,
level_mesh[cur_level].start_cell, level_mesh[cur_level].num_cells );MB_CHK_ERR( error );
error = ahf->update_entity_ranges( *set );MB_CHK_ERR( error );
// If the mesh type changes, then update the member variable in ahf to use the applicable
// adjacency matrix
MESHTYPE nwmesh = ahf->get_mesh_type( level_mesh[cur_level].num_verts, level_mesh[cur_level].num_edges,
level_mesh[cur_level].num_faces, level_mesh[cur_level].num_cells );MB_CHK_ERR( error );
if( ahf->thismeshtype != nwmesh ) ahf->thismeshtype = nwmesh;
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::estimate_hm_storage | ( | EntityHandle | set, |
| int | level_degree, | ||
| int | cur_level, | ||
| int | hmest[4] | ||
| ) | [protected] |
Definition at line 564 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, _inverts, moab::Range::begin(), count_subentities(), moab::error(), ErrorCode, get_index_from_degree(), intFacEdg, level_mesh, MB_CHK_ERR, MB_SUCCESS, MBEDGE, mbImpl, meshdim, moab::NestedRefine::intFEdge::nie, moab::NestedRefine::level_memory::num_cells, moab::NestedRefine::level_memory::num_edges, moab::NestedRefine::level_memory::num_faces, moab::NestedRefine::level_memory::num_verts, moab::NestedRefine::refPatterns::nv_cell, moab::NestedRefine::refPatterns::nv_edge, moab::NestedRefine::refPatterns::nv_face, refTemplates, moab::Range::size(), moab::NestedRefine::level_memory::start_face, moab::NestedRefine::refPatterns::total_new_ents, and moab::Core::type_from_handle().
Referenced by generate_hm().
{
ErrorCode error;
// Obtain the size of input mesh.
int nverts_prev, nedges_prev, nfaces_prev, ncells_prev;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nedges_prev = level_mesh[cur_level - 1].num_edges;
nfaces_prev = level_mesh[cur_level - 1].num_faces;
ncells_prev = level_mesh[cur_level - 1].num_cells;
}
else
{
nverts_prev = _inverts.size();
nedges_prev = _inedges.size();
nfaces_prev = _infaces.size();
ncells_prev = _incells.size();
}
// Estimate mesh size of current level mesh.
int nedges = 0, nfaces = 0;
error = count_subentities( set, cur_level - 1, &nedges, &nfaces );MB_CHK_ERR( error );
int d = get_index_from_degree( level_degree );
int nverts = refTemplates[MBEDGE - 1][d].nv_edge * nedges;
hmest[0] = nverts_prev + nverts;
hmest[1] = nedges_prev * refTemplates[MBEDGE - 1][d].total_new_ents;
hmest[2] = 0;
hmest[3] = 0;
int findex, cindex;
if( nfaces_prev != 0 )
{
EntityHandle start_face;
if( cur_level )
start_face = level_mesh[cur_level - 1].start_face;
else
start_face = *_infaces.begin();
findex = mbImpl->type_from_handle( start_face ) - 1;
hmest[2] = nfaces_prev * refTemplates[findex][d].total_new_ents;
if( meshdim == 2 ) hmest[0] += refTemplates[findex][d].nv_face * nfaces_prev;
if( meshdim == 3 ) hmest[1] += nfaces_prev * intFacEdg[findex - 1][d].nie;
}
if( ncells_prev != 0 )
{
cindex = mbImpl->type_from_handle( *( _incells.begin() ) ) - 1;
hmest[3] = ncells_prev * refTemplates[cindex][d].total_new_ents;
hmest[0] += refTemplates[cindex][d].nv_face * nfaces;
hmest[0] += refTemplates[cindex][d].nv_cell * ncells_prev;
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::exchange_ghosts | ( | std::vector< EntityHandle > & | lsets, |
| int | num_glayers | ||
| ) |
Definition at line 454 of file NestedRefine.cpp.
References moab::Core::add_entities(), moab::error(), ErrorCode, moab::ParallelComm::exchange_ghost_cells(), moab::ParallelComm::exchange_tags(), moab::Core::get_adjacencies(), moab::Core::get_connectivity(), moab::Core::get_entities_by_dimension(), GLOBAL_ID_TAG_NAME, hasghost, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, mbImpl, meshdim, pcomm, and moab::Interface::UNION.
Referenced by main().
{
ErrorCode error;
if( hasghost ) return MB_SUCCESS;
hasghost = true;
#ifdef MOAB_HAVE_MPI
error = pcomm->exchange_ghost_cells( meshdim, 0, num_glayers, 0, true, false );MB_CHK_ERR( error );
{
Range empty_range;
error = pcomm->exchange_tags( GLOBAL_ID_TAG_NAME, empty_range );MB_CHK_ERR( error );
// error = pcomm->assign_global_ids(lsets[i], 0, 1, false, true, false);MB_CHK_ERR(error);
}
#else
MB_SET_ERR( MB_FAILURE, "Requesting ghost layers for a serial mesh" );
#endif
Range* lverts = new Range[lsets.size()];
Range* lents = new Range[lsets.size()];
for( size_t i = 0; i < lsets.size(); i++ )
{
error = mbImpl->get_entities_by_dimension( lsets[i], meshdim, lents[i] );MB_CHK_ERR( error );
error = mbImpl->get_connectivity( lents[i], lverts[i] );MB_CHK_ERR( error );
for( int gl = 0; gl < num_glayers; gl++ )
{
error = mbImpl->get_adjacencies( lverts[i], meshdim, false, lents[i], Interface::UNION );MB_CHK_ERR( error );
error = mbImpl->get_connectivity( lents[i], lverts[i] );MB_CHK_ERR( error );
}
}
for( size_t i = 0; i < lsets.size(); i++ )
{
error = mbImpl->add_entities( lsets[i], lverts[i] );MB_CHK_ERR( error );
error = mbImpl->add_entities( lsets[i], lents[i] );MB_CHK_ERR( error );
}
delete[] lverts;
delete[] lents;
return MB_SUCCESS;
}
| int moab::NestedRefine::find_shortest_diagonal_octahedron | ( | int | cur_level, |
| int | deg, | ||
| EntityHandle * | vbuffer | ||
| ) | [protected] |
Definition at line 4580 of file NestedRefine.cpp.
References moab::error(), ErrorCode, get_octahedron_corner_coords(), length(), MB_SET_ERR, and MB_SUCCESS.
Referenced by subdivide_tets().
{
ErrorCode error;
double coords[18];
error = get_octahedron_corner_coords( cur_level, deg, vbuffer, coords );
if( error != MB_SUCCESS ) MB_SET_ERR( MB_FAILURE, "Error in obtaining octahedron corner coordinates" );
int diag_map[6] = { 1, 3, 2, 4, 5, 0 };
double length = std::numeric_limits< double >::max();
int diag = 0;
double x, y, z;
x = y = z = 0;
for( int d = 0; d < 3; d++ )
{
int id1 = diag_map[2 * d];
int id2 = diag_map[2 * d + 1];
x = coords[3 * id1] - coords[3 * id2];
y = coords[3 * id1 + 1] - coords[3 * id2 + 1];
z = coords[3 * id1 + 2] - coords[3 * id2 + 2];
double dlen = sqrt( x * x + y * y + z * z );
if( dlen < length )
{
length = dlen;
diag = d + 1;
}
}
return diag;
}
| ErrorCode moab::NestedRefine::generate_hm | ( | int * | level_degrees, |
| int | num_level, | ||
| EntityHandle * | hm_set, | ||
| bool | optimize | ||
| ) | [protected] |
Definition at line 715 of file NestedRefine.cpp.
References _rset, construct_hm_entities(), copy_vertices_from_prev_level(), create_hm_storage_single_level(), moab::error(), ErrorCode, estimate_hm_storage(), GLOBAL_ID_TAG_NAME, MB_CHK_ERR, MB_SUCCESS, mbImpl, nlevels, pcomm, moab::ParallelComm::size(), moab::Core::tag_get_handle(), moab::CpuTimer::time_elapsed(), timeall, tm, moab::NestedRefine::codeperf::tm_refine, moab::NestedRefine::codeperf::tm_resolve, and moab::NestedRefine::codeperf::tm_total.
Referenced by generate_mesh_hierarchy().
{
ErrorCode error;
Tag gidtag;
error = mbImpl->tag_get_handle( GLOBAL_ID_TAG_NAME, gidtag );MB_CHK_ERR( error );
nlevels = num_level;
timeall.tm_total = 0;
timeall.tm_refine = 0;
timeall.tm_resolve = 0;
for( int l = 0; l < num_level; l++ )
{
double tstart;
tstart = tm->time_elapsed();
// Estimate storage
int hmest[4] = { 0, 0, 0, 0 };
EntityHandle set;
if( l )
set = hm_set[l - 1];
else
set = _rset;
error = estimate_hm_storage( set, level_degrees[l], l, hmest );MB_CHK_ERR( error );
// Create arrays for storing the current level
error = create_hm_storage_single_level( &hm_set[l], l, hmest );MB_CHK_ERR( error );
// Copy the old vertices along with their coordinates
error = copy_vertices_from_prev_level( l );MB_CHK_ERR( error );
// Create the new entities and new vertices
error = construct_hm_entities( l, level_degrees[l] );MB_CHK_ERR( error );
timeall.tm_refine += tm->time_elapsed() - tstart;
// Go into parallel communication
if( !optimize )
{
#ifdef MOAB_HAVE_MPI
if( pcomm && ( pcomm->size() > 1 ) )
{
double tpstart = tm->time_elapsed();
error = resolve_shared_ents_parmerge( l, hm_set[l] );MB_CHK_ERR( error );
timeall.tm_resolve += tm->time_elapsed() - tpstart;
}
#endif
}
}
if( optimize )
{
#ifdef MOAB_HAVE_MPI
if( pcomm && ( pcomm->size() > 1 ) )
{
double tpstart = tm->time_elapsed();
error = resolve_shared_ents_opt( hm_set, nlevels );MB_CHK_ERR( error );
timeall.tm_resolve = tm->time_elapsed() - tpstart;
}
#endif
}
timeall.tm_total = timeall.tm_refine + timeall.tm_resolve;
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::generate_mesh_hierarchy | ( | int | num_level, |
| int * | level_degrees, | ||
| std::vector< EntityHandle > & | level_sets, | ||
| bool | optimize = false |
||
| ) |
Generate a mesh hierarchy.
Given a mesh, generate a sequence of meshes via uniform refinement. The inputs are: a) an array(level_degrees) storing the degrees which will be used to refine the previous level mesh to generate a new level and b) the total number of levels(should be same length as that of the array in a). Each mesh level in the hierarchy are stored in different meshsets whose handles are returned after the hierarchy generation. These handles can be used to work with a specific mesh level.
| level_degrees | Integer array storing the degrees used in each level. |
| num_level | The total number of levels in the hierarchy. |
| hm_set | EntityHandle STL vector that returns the handles of the sets created for each mesh level. |
Definition at line 114 of file NestedRefine.cpp.
References _rset, moab::error(), ErrorCode, generate_hm(), level_dsequence, MB_CHK_ERR, MB_SUCCESS, meshdim, and nlevels.
Referenced by main().
{
assert( num_level > 0 );
nlevels = num_level;
ErrorCode error;
std::vector< moab::EntityHandle > hmsets( num_level );
if( meshdim <= 2 )
{
for( int i = 0; i < num_level; i++ )
{
assert( ( level_degrees[i] == 2 ) || ( level_degrees[i] == 3 ) || ( level_degrees[i] == 5 ) );
level_dsequence[i] = level_degrees[i];
}
}
else
{
for( int i = 0; i < num_level; i++ )
{
assert( ( level_degrees[i] == 2 ) || ( level_degrees[i] == 3 ) );
level_dsequence[i] = level_degrees[i];
}
}
error = generate_hm( level_degrees, num_level, &hmsets[0], optimize );MB_CHK_ERR( error );
// copy the entity handles
level_sets.resize( num_level + 1 );
level_sets[0] = _rset;
for( int i = 0; i < num_level; i++ )
level_sets[i + 1] = hmsets[i];
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::get_adjacencies | ( | const EntityHandle | source_entity, |
| const unsigned int | target_dimension, | ||
| std::vector< EntityHandle > & | target_entities | ||
| ) |
Get the adjacencies associated with an entity.
Given an entity of dimension d, gather all the adjacent D dimensional entities where D >, = , < d .
| source_entity | EntityHandle to which adjacent entities have to be found. |
| target_dimension | Int Dimension of the desired adjacent entities. |
| target_entities | Vector in which the adjacent EntityHandle are returned. |
Definition at line 223 of file NestedRefine.cpp.
References ahf, moab::error(), ErrorCode, moab::HalfFacetRep::get_adjacencies(), MB_CHK_ERR, and MB_SUCCESS.
{
ErrorCode error;
error = ahf->get_adjacencies( source_entity, target_dimension, target_entities );MB_CHK_ERR( error );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::get_connectivity | ( | EntityHandle | ent, |
| int | level, | ||
| std::vector< EntityHandle > & | conn | ||
| ) |
Given an entity and its level, return its connectivity.
Given an entity at a certain level, it finds the connectivity via direct access to a stored internal pointer to the memory to connectivity sequence for the given level.
| ent | EntityHandle of the entity |
| level | Integer level of the entity for which connectivity is requested |
| conn | std::vector returning the connectivity of the entity |
Definition at line 153 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), moab::NestedRefine::level_memory::cell_conn, moab::error(), ErrorCode, moab::NestedRefine::level_memory::face_conn, moab::Core::get_connectivity(), moab::HalfFacetRep::get_index_in_lmap(), moab::ID_FROM_HANDLE(), moab::HalfFacetRep::lConnMap2D, moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, MBEDGE, MBHEX, mbImpl, MBQUAD, MBTET, MBTRI, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_face, and moab::Core::type_from_handle().
Referenced by construct_hm_1D(), construct_hm_2D(), get_local_vid(), reorder_indices(), subdivide_cells(), subdivide_tets(), update_global_ahf_1D_sub(), update_global_ahf_2D(), and update_global_ahf_2D_sub().
{
ErrorCode error;
EntityType type = mbImpl->type_from_handle( ent );
EntityHandle start_ent;
if( !conn.empty() ) conn.clear();
if( level > 0 )
{
if( type == MBEDGE )
{
conn.reserve( 2 );
start_ent = level_mesh[level - 1].start_edge;
EntityID offset = ID_FROM_HANDLE( ent ) - ID_FROM_HANDLE( start_ent );
conn.push_back( level_mesh[level - 1].edge_conn[2 * offset] );
conn.push_back( level_mesh[level - 1].edge_conn[2 * offset + 1] );
}
else if( type == MBTRI || type == MBQUAD )
{
int num_corners = ahf->lConnMap2D[type - 2].num_verts_in_face;
conn.reserve( num_corners );
start_ent = level_mesh[level - 1].start_face;
EntityID offset = ID_FROM_HANDLE( ent ) - ID_FROM_HANDLE( start_ent );
for( int i = 0; i < num_corners; i++ )
conn.push_back( level_mesh[level - 1].face_conn[num_corners * offset + i] );
}
else if( type == MBTET || type == MBHEX )
{
int index = ahf->get_index_in_lmap( *_incells.begin() );
int num_corners = ahf->lConnMap3D[index].num_verts_in_cell;
conn.reserve( num_corners );
start_ent = level_mesh[level - 1].start_cell;
EntityID offset = ID_FROM_HANDLE( ent ) - ID_FROM_HANDLE( start_ent );
for( int i = 0; i < num_corners; i++ )
conn.push_back( level_mesh[level - 1].cell_conn[num_corners * offset + i] );
}
else
MB_SET_ERR( MB_FAILURE, "Requesting connectivity for an unsupported entity type" );
}
else
{
error = mbImpl->get_connectivity( &ent, 1, conn );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::get_coordinates | ( | EntityHandle * | verts, |
| int | num_verts, | ||
| int | level, | ||
| double * | coords | ||
| ) |
Given a vector of vertices and their level, return its coordinates.
Given a vector of vertices at a certain level, it finds the coordinates via direct access to a stored internal pointer to the memory to coordinate sequence for the given level.
| verts | std::vector of the entity handles of the vertices |
| num_verts | The number of vertices |
| level | Integer level of the entity for which connectivity is requested |
| coords | double pointer returning the coordinates of the vertices |
Definition at line 200 of file NestedRefine.cpp.
References moab::NestedRefine::level_memory::coordinates, moab::error(), ErrorCode, moab::Core::get_coords(), moab::ID_FROM_HANDLE(), level_mesh, MB_CHK_ERR, MB_SUCCESS, and mbImpl.
Referenced by construct_hm_2D(), subdivide_cells(), and subdivide_tets().
{
if( level > 0 )
{
EntityID vstart = ID_FROM_HANDLE( level_mesh[level - 1].start_vertex );
for( int i = 0; i < num_verts; i++ )
{
const EntityHandle& vid = verts[i];
EntityID offset = ID_FROM_HANDLE( vid ) - vstart;
coords[3 * i] = level_mesh[level - 1].coordinates[0][offset];
coords[3 * i + 1] = level_mesh[level - 1].coordinates[1][offset];
coords[3 * i + 2] = level_mesh[level - 1].coordinates[2][offset];
}
}
else
{
ErrorCode error;
error = mbImpl->get_coords( verts, num_verts, coords );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| int moab::NestedRefine::get_index_from_degree | ( | int | degree | ) | [protected] |
Definition at line 4634 of file NestedRefine.cpp.
References deg_index.
Referenced by child_to_parent(), compute_coordinates(), construct_hm_1D(), construct_hm_2D(), estimate_hm_storage(), get_lid_inci_child(), parent_to_child(), subdivide_cells(), subdivide_tets(), update_global_ahf_1D(), update_global_ahf_1D_sub(), update_global_ahf_2D(), update_global_ahf_2D_sub(), update_global_ahf_3D(), update_local_ahf(), and update_tracking_verts().
{
int d = deg_index.find( degree )->second;
return d;
}
| ErrorCode moab::NestedRefine::get_lid_inci_child | ( | EntityType | type, |
| int | deg, | ||
| int | lfid, | ||
| int | leid, | ||
| std::vector< int > & | child_ids, | ||
| std::vector< int > & | child_lvids | ||
| ) | [protected] |
Definition at line 3985 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), moab::NestedRefine::refPatterns::ents_conn, moab::NestedRefine::refPatterns::ents_on_pent, get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::lConnMap3D, MB_SUCCESS, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::NestedRefine::refPatterns::nv_edge, and refTemplates.
{
int index = ahf->get_index_in_lmap( *_incells.begin() );
int d = get_index_from_degree( deg );
// int lv0 = ahf->lConnMap3D[index].e2v[leid][0];
// int lv1 = ahf->lConnMap3D[index].e2v[leid][1];
int nvpc = ahf->lConnMap3D[index].num_verts_in_cell;
int nv = refTemplates[type - 1][d].nv_edge;
int nch = refTemplates[type - 1][d].ents_on_pent[lfid][0];
for( int i = 0; i < nch; i++ )
{
int id = refTemplates[type - 1][d].ents_on_pent[lfid][i + 1] - 1;
for( int j = 0; j < nvpc; j++ )
{
int lv = refTemplates[type - 1][d].ents_conn[id][j];
for( int k = 0; k < nv; k++ )
{
if( lv == refTemplates[type - 1][d].vert_on_edges[leid][k] )
{
child_ids.push_back( id );
child_lvids.push_back( j );
}
}
}
}
return MB_SUCCESS;
}
| int moab::NestedRefine::get_local_vid | ( | EntityHandle | vid, |
| EntityHandle | ent, | ||
| int | level | ||
| ) | [protected] |
Definition at line 4612 of file NestedRefine.cpp.
References moab::error(), ErrorCode, get_connectivity(), MB_SET_ERR, and MB_SUCCESS.
Referenced by update_global_ahf_1D(), update_global_ahf_1D_sub(), update_global_ahf_2D(), update_global_ahf_2D_sub(), and update_global_ahf_3D().
{
ErrorCode error;
// Given a vertex, find its local id in the given entity
std::vector< EntityHandle > conn;
error = get_connectivity( ent, level + 1, conn );
if( error != MB_SUCCESS ) MB_SET_ERR( MB_FAILURE, "Error in getting connectivity of the requested entity" );
int lid = -1;
for( int i = 0; i < (int)conn.size(); i++ )
{
if( conn[i] == vid )
{
lid = i;
break;
}
}
if( lid < 0 ) MB_SET_ERR( MB_FAILURE, "Error in getting local vertex id in the given entity" );
return lid;
}
| ErrorCode moab::NestedRefine::get_octahedron_corner_coords | ( | int | cur_level, |
| int | deg, | ||
| EntityHandle * | vbuffer, | ||
| double * | ocoords | ||
| ) | [protected] |
Definition at line 4544 of file NestedRefine.cpp.
References moab::NestedRefine::level_memory::coordinates, level_mesh, MB_SUCCESS, and moab::NestedRefine::level_memory::start_vertex.
Referenced by find_shortest_diagonal_octahedron().
{
int lid[6] = { 0, 0, 0, 0, 0, 0 };
if( deg == 2 )
{
lid[0] = 5;
lid[1] = 8;
lid[2] = 9;
lid[3] = 6;
lid[4] = 4;
lid[5] = 7;
}
else if( deg == 3 )
{
lid[0] = 19;
lid[1] = 16;
lid[2] = 18;
lid[3] = 9;
lid[4] = 4;
lid[5] = 10;
}
EntityHandle vstart = level_mesh[cur_level].start_vertex;
for( int i = 0; i < 6; i++ )
{
EntityHandle vid = vbuffer[lid[i]];
ocoords[3 * i] = level_mesh[cur_level].coordinates[0][vid - vstart];
ocoords[3 * i + 1] = level_mesh[cur_level].coordinates[1][vid - vstart];
ocoords[3 * i + 2] = level_mesh[cur_level].coordinates[2][vid - vstart];
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::get_vertex_duplicates | ( | EntityHandle | vertex, |
| int | level, | ||
| EntityHandle & | dupvertex | ||
| ) |
Definition at line 425 of file NestedRefine.cpp.
References _inverts, moab::Range::begin(), level_mesh, MB_SET_ERR, MB_SUCCESS, moab::Range::size(), and moab::NestedRefine::level_memory::start_vertex.
{
if( ( vertex - *_inverts.begin() ) > _inverts.size() )
MB_SET_ERR( MB_FAILURE, "Requesting duplicates for non-coarse vertices" );
dupvertex = level_mesh[level - 1].start_vertex + ( vertex - *_inverts.begin() );
return MB_SUCCESS;
}
Definition at line 53 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, _inverts, _rset, moab::Core::a_half_facet_rep(), ahf, moab::HalfFacetRep::check_mixed_entity_type(), deg_index, elementype, moab::Range::empty(), moab::error(), ErrorCode, moab::HalfFacetRep::get_entity_ranges(), hasghost, moab::HalfFacetRep::initialize(), MB_CHK_ERR, MB_MEMORY_ALLOCATION_FAILED, MB_NOT_IMPLEMENTED, MB_SET_ERR, MB_SUCCESS, MBEDGE, MBHEX, mbImpl, MBPOLYGON, MBTET, meshdim, pcomm, tm, and moab::Core::type_from_handle().
Referenced by NestedRefine().
{
ErrorCode error;
tm = new CpuTimer();
if( !tm ) return MB_MEMORY_ALLOCATION_FAILED;
#ifdef MOAB_HAVE_AHF
ahf = mbImpl->a_half_facet_rep();
#else
ahf = new HalfFacetRep( mbImpl, pcomm, _rset, true );
if( !ahf ) return MB_MEMORY_ALLOCATION_FAILED;
#endif
// Check for mixed entity type
bool chk_mixed = ahf->check_mixed_entity_type();
if( chk_mixed ) MB_SET_ERR( MB_NOT_IMPLEMENTED, "Encountered a mesh with mixed entity types" );
error = ahf->initialize();MB_CHK_ERR( error );
error = ahf->get_entity_ranges( _inverts, _inedges, _infaces, _incells );MB_CHK_ERR( error );
// Check for supported entity type
if( !_incells.empty() )
{
EntityType type = mbImpl->type_from_handle( _incells[0] );
if( type != MBTET && type != MBHEX )
MB_SET_ERR( MB_FAILURE, "Not supported 3D entity types: MBPRISM, MBPYRAMID, MBKNIFE, MBPOLYHEDRON" );
meshdim = 3;
elementype = type;
}
else if( !_infaces.empty() )
{
EntityType type = mbImpl->type_from_handle( _infaces[0] );
if( type == MBPOLYGON ) MB_SET_ERR( MB_FAILURE, "Not supported 2D entity type: POLYGON" );
meshdim = 2;
elementype = type;
}
else if( !_inedges.empty() )
{
meshdim = 1;
elementype = MBEDGE;
}
else
MB_SET_ERR( MB_NOT_IMPLEMENTED, "Encountered a mixed-dimensional or invalid mesh" );
// Initialize std::map to get indices of degrees.
deg_index[2] = 0;
deg_index[3] = 1;
deg_index[5] = 2;
// Set ghost flag to false
hasghost = false;
return MB_SUCCESS;
}
| bool moab::NestedRefine::is_cell_on_boundary | ( | const EntityHandle & | entity | ) | [protected] |
Definition at line 4138 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), elementype, ErrorCode, moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::lConnMap3D, MB_CHK_ERR, MB_SET_ERR, meshdim, and moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell.
Referenced by is_entity_on_boundary().
{
if( meshdim != 3 )
MB_SET_ERR( MB_FAILURE, "Requesting boundary information for a cell entity type on a curve or surface mesh" );
bool is_border = false;
int index = ahf->get_index_in_lmap( *_incells.begin() );
int nfpc = ahf->lConnMap3D[index].num_faces_in_cell;
EntityHandle sibents[6];
int siblids[6];
ErrorCode error = ahf->get_sibling_map( elementype, entity, &sibents[0], &siblids[0], nfpc );MB_CHK_ERR( error );
for( int i = 0; i < nfpc; i++ )
{
if( sibents[i] == 0 )
{
is_border = true;
break;
}
}
return is_border;
}
| bool moab::NestedRefine::is_edge_on_boundary | ( | const EntityHandle & | entity | ) | [protected] |
Definition at line 4053 of file NestedRefine.cpp.
References ahf, moab::HalfFacetRep::LocalMaps3D::e2hf, elementype, moab::error(), ErrorCode, moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::get_up_adjacencies_2d(), moab::HalfFacetRep::get_up_adjacencies_edg_3d(), moab::HalfFacetRep::lConnMap3D, MB_CHK_ERR, MBEDGE, meshdim, and moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell.
Referenced by is_entity_on_boundary().
{
ErrorCode error;
bool is_border = false;
if( meshdim == 1 ) // The edge has a vertex on the boundary in the curve mesh
{
EntityHandle sibents[2];
int siblids[2];
error = ahf->get_sibling_map( MBEDGE, entity, &sibents[0], &siblids[0], 2 );MB_CHK_ERR( error );
for( int i = 0; i < 2; i++ )
{
if( sibents[i] == 0 )
{
is_border = true;
break;
}
}
}
else if( meshdim == 2 ) // The edge is on the boundary of the 2d mesh
{
std::vector< EntityHandle > adjents;
error = ahf->get_up_adjacencies_2d( entity, adjents );MB_CHK_ERR( error );
if( adjents.size() == 1 ) is_border = true;
}
else if( meshdim == 3 ) // The edge is part of a face on the boundary of the 3d mesh
{
std::vector< EntityHandle > adjents;
std::vector< int > leids;
error = ahf->get_up_adjacencies_edg_3d( entity, adjents, &leids );MB_CHK_ERR( error );
assert( !adjents.empty() );
int index = ahf->get_index_in_lmap( adjents[0] );
int nhf = ahf->lConnMap3D[index].num_faces_in_cell;
for( int i = 0; i < (int)adjents.size(); i++ )
{
EntityHandle sibents[6];
int siblids[6];
error = ahf->get_sibling_map( elementype, adjents[0], &sibents[0], &siblids[0], nhf );MB_CHK_ERR( error );
for( int k = 0; k < 2; k++ )
{
int hf = ahf->lConnMap3D[index].e2hf[leids[0]][k];
if( sibents[hf] == 0 )
{
is_border = true;
break;
}
}
}
}
return is_border;
}
| bool moab::NestedRefine::is_entity_on_boundary | ( | const EntityHandle & | entity | ) |
Given an entity at a certain level, it returns a boolean value true if it lies on the domain boundary.
| entity |
Definition at line 435 of file NestedRefine.cpp.
References is_cell_on_boundary(), is_edge_on_boundary(), is_face_on_boundary(), is_vertex_on_boundary(), MB_SET_ERR, MBEDGE, MBHEX, mbImpl, MBQUAD, MBTET, MBTRI, MBVERTEX, and moab::Core::type_from_handle().
{
bool is_border = false;
EntityType type = mbImpl->type_from_handle( entity );
if( type == MBVERTEX )
is_border = is_vertex_on_boundary( entity );
else if( type == MBEDGE )
is_border = is_edge_on_boundary( entity );
else if( type == MBTRI || type == MBQUAD )
is_border = is_face_on_boundary( entity );
else if( type == MBTET || type == MBHEX )
is_border = is_cell_on_boundary( entity );
else
MB_SET_ERR( MB_FAILURE, "Requesting boundary information for unsupported entity type" );
return is_border;
}
| bool moab::NestedRefine::is_face_on_boundary | ( | const EntityHandle & | entity | ) | [protected] |
Definition at line 4106 of file NestedRefine.cpp.
References ahf, elementype, moab::error(), ErrorCode, moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::get_up_adjacencies_face_3d(), moab::HalfFacetRep::lConnMap2D, MB_CHK_ERR, MB_SET_ERR, meshdim, and moab::HalfFacetRep::LocalMaps2D::num_verts_in_face.
Referenced by is_entity_on_boundary().
{
ErrorCode error;
bool is_border = false;
if( meshdim == 1 )
MB_SET_ERR( MB_FAILURE, "Requesting boundary information for a face entity type on a curve mesh" );
else if( meshdim == 2 ) // The face has a local edge on the boundary of the 2d mesh
{
EntityHandle sibents[4];
int siblids[4];
int nepf = ahf->lConnMap2D[elementype - 2].num_verts_in_face;
error = ahf->get_sibling_map( elementype, entity, &sibents[0], &siblids[0], nepf );MB_CHK_ERR( error );
for( int i = 0; i < nepf; i++ )
{
if( sibents[i] == 0 )
{
is_border = true;
break;
}
}
}
else if( meshdim == 3 ) // The face lies on the boundary of the 3d mesh
{
std::vector< EntityHandle > adjents;
error = ahf->get_up_adjacencies_face_3d( entity, adjents );MB_CHK_ERR( error );
if( adjents.size() == 1 ) is_border = true;
}
return is_border;
}
| bool moab::NestedRefine::is_vertex_on_boundary | ( | const EntityHandle & | entity | ) | [protected] |
Boundary extraction functions Given a vertex at a certain level, it returns a boolean value true if it lies on the domain boundary. Note: This is a specialization of the NestedRefine::is_entity_on_boundary function and applies only to vertex queries.
| entity |
Definition at line 4026 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), elementype, moab::error(), ErrorCode, moab::HalfFacetRep::get_incident_map(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::lConnMap2D, moab::HalfFacetRep::lConnMap3D, MB_CHK_ERR, MB_SET_ERR, MBEDGE, MBHEX, MBQUAD, MBTET, MBTRI, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, and moab::HalfFacetRep::LocalMaps2D::num_verts_in_face.
Referenced by is_entity_on_boundary().
{
ErrorCode error;
EntityHandle sibents[27];
int siblids[27];
std::vector< EntityHandle > ent;
std::vector< int > lid;
int nhf;
if( elementype == MBEDGE )
nhf = 2;
else if( ( elementype == MBTRI ) || ( elementype == MBQUAD ) )
nhf = ahf->lConnMap2D[elementype - 2].num_verts_in_face;
else if( ( elementype == MBTET ) || ( elementype == MBHEX ) )
{
int idx = ahf->get_index_in_lmap( *_incells.begin() );
nhf = ahf->lConnMap3D[idx].num_faces_in_cell;
}
else
MB_SET_ERR( MB_FAILURE, "Requesting vertex boundary information for an unsupported entity type" );
error = ahf->get_incident_map( elementype, vertex, ent, lid );MB_CHK_ERR( error );
error = ahf->get_sibling_map( elementype, ent[0], &sibents[0], &siblids[0], nhf );MB_CHK_ERR( error );
return ( sibents[lid[0]] == 0 );
}
| ErrorCode moab::NestedRefine::parent_to_child | ( | EntityHandle | parent, |
| int | parent_level, | ||
| int | child_level, | ||
| std::vector< EntityHandle > & | children | ||
| ) |
Given an entity from a certain level, it returns a std::vector of all its children from the requested child level. NOTE: This query does not support vertices.
| parent | EntityHandle of the entity whose children in subsequent level is requested |
| parent_level | Mesh level where the parent exists |
| child_level | Mesh level from which its children are requested |
| children | Vector containing all childrens from the requested child_level |
Definition at line 285 of file NestedRefine.cpp.
References _incells, _inedges, _infaces, child, get_index_from_degree(), moab::Range::index(), level_dsequence, level_mesh, MB_SET_ERR, MB_SUCCESS, MBEDGE, MBHEX, mbImpl, MBQUAD, MBTET, MBTRI, MBVERTEX, refTemplates, moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_face, moab::NestedRefine::refPatterns::total_new_ents, and moab::Core::type_from_handle().
Referenced by update_special_tags(), and vertex_to_entities_down().
{
assert( ( child_level > 0 ) && ( child_level > parent_level ) );
EntityType type = mbImpl->type_from_handle( parent );
assert( type != MBVERTEX );
int parent_index;
if( type == MBEDGE )
{
if( parent_level > 0 )
parent_index = parent - level_mesh[parent_level - 1].start_edge;
else
parent_index = _inedges.index( parent );
}
else if( type == MBTRI || type == MBQUAD )
{
if( parent_level > 0 )
parent_index = parent - level_mesh[parent_level - 1].start_face;
else
parent_index = _infaces.index( parent );
}
else if( type == MBTET || type == MBHEX )
{
if( parent_level > 0 )
parent_index = parent - level_mesh[parent_level - 1].start_cell;
else
parent_index = _incells.index( parent );
}
else
MB_SET_ERR( MB_FAILURE, "Requesting children for unsupported entity type" );
int start, end;
start = end = parent_index;
for( int i = parent_level; i < child_level; i++ )
{
int d = get_index_from_degree( level_dsequence[i] );
int nch = refTemplates[type - 1][d].total_new_ents;
start = start * nch;
end = end * nch + nch - 1;
}
int num_child = end - start;
children.reserve( num_child );
for( int i = start; i <= end; i++ )
{
EntityHandle child;
if( type == MBEDGE )
child = level_mesh[child_level - 1].start_edge + i;
else if( type == MBTRI || type == MBQUAD )
child = level_mesh[child_level - 1].start_face + i;
else if( type == MBTET || type == MBHEX )
child = level_mesh[child_level - 1].start_cell + i;
children.push_back( child );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::print_maps_1D | ( | int | level | ) | [protected] |
| ErrorCode moab::NestedRefine::print_maps_2D | ( | int | level, |
| EntityType | type | ||
| ) | [protected] |
| ErrorCode moab::NestedRefine::print_maps_3D | ( | int | level, |
| EntityType | type | ||
| ) | [protected] |
| ErrorCode moab::NestedRefine::reorder_indices | ( | int | cur_level, |
| int | deg, | ||
| EntityHandle | cell, | ||
| int | lfid, | ||
| EntityHandle | sib_cell, | ||
| int | sib_lfid, | ||
| int | index, | ||
| int * | id_sib | ||
| ) | [protected] |
Definition at line 4322 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), moab::NestedRefine::pmat::comb, moab::error(), ErrorCode, get_connectivity(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::LocalMaps3D::hf2v, moab::HalfFacetRep::LocalMaps3D::hf2v_num, moab::HalfFacetRep::lConnMap3D, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, moab::NestedRefine::pmat::num_comb, and permutation.
Referenced by construct_hm_2D(), update_global_ahf_3D(), and update_tracking_verts().
{
// Reorders the indices of either vertices or children cell local ids to match with order of the
// given cell and a local face. index = 0 : vertices,
// = 1 : face
assert( deg == 2 || deg == 3 );
ErrorCode error;
int idx = ahf->get_index_in_lmap( *_incells.begin() );
int nvF = ahf->lConnMap3D[idx].hf2v_num[lfid];
int nco = permutation[nvF - 3].num_comb;
if( !index && ( ( nvF == 3 && deg == 3 ) || ( nvF == 4 && deg == 2 ) ) )
{
id_sib[0] = 1;
}
else
{
// Get connectivity of the cell and its sibling cell
std::vector< EntityHandle > conn, sib_conn;
error = get_connectivity( cell, cur_level, conn );MB_CHK_ERR( error );
error = get_connectivity( sib_cell, cur_level, sib_conn );MB_CHK_ERR( error );
// Get the connectivity of the local face in the cell and its sibling
std::vector< EntityHandle > lface( nvF );
std::vector< EntityHandle > lface_sib( nvF );
for( int i = 0; i < nvF; i++ )
{
int id = ahf->lConnMap3D[idx].hf2v[lfid][i];
lface[i] = conn[id];
id = ahf->lConnMap3D[idx].hf2v[sib_lfid][i];
lface_sib[i] = sib_conn[id];
}
// Find the combination
int c = 0;
for( int i = 0; i < nco; i++ )
{
int count = 0;
for( int j = 0; j < nvF; j++ )
{
int id = permutation[nvF - 3].comb[i][j];
if( lface[j] == lface_sib[id] ) count += 1;
}
if( count == nvF )
{
c = i;
break;
}
}
if( c > nco ) MB_SET_ERR( MB_FAILURE, "Getting a combination number more than currently supported" );
// Get the ordered indices
if( ( ( !index ) && ( nvF == 4 ) && ( deg == 3 ) ) || ( deg == 2 ) )
{
for( int i = 0; i < 4; i++ )
id_sib[i] = permutation[nvF - 3].porder2[c][i];
}
else
{
for( int i = 0; i < 9; i++ )
id_sib[i] = permutation[nvF - 3].porder3[c][i];
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::reorder_indices | ( | int | deg, |
| EntityHandle * | face1_conn, | ||
| EntityHandle * | face2_conn, | ||
| int | nvF, | ||
| std::vector< int > & | lemap, | ||
| std::vector< int > & | vidx, | ||
| int * | leorient = NULL |
||
| ) | [protected] |
Definition at line 4402 of file NestedRefine.cpp.
References moab::NestedRefine::pmat::comb, MB_SET_ERR, MB_SUCCESS, moab::NestedRefine::pmat::num_comb, moab::NestedRefine::pmat::orient, permutation, and moab::NestedRefine::pmat::porder2.
{
// Given the connectivities of two faces, get the permuted indices w.r.t first face.
// Step 1: First find the orientation
int nco = permutation[nvF - 3].num_comb;
int c = 0;
for( int i = 0; i < nco; i++ )
{
int count = 0;
for( int j = 0; j < nvF; j++ )
{
int id = permutation[nvF - 3].comb[i][j];
if( face1_conn[j] == face2_conn[id] ) count += 1;
}
if( count == nvF )
{
c = i;
break;
}
}
if( c > nco ) MB_SET_ERR( MB_FAILURE, "Getting a combination number more than currently supported" );
// Add the corresponding local edges
lemap.reserve( nvF );
for( int i = 0; i < nvF; i++ )
{
lemap.push_back( permutation[nvF - 3].lemap[c][i] );
}
if( leorient ) leorient[0] = permutation[nvF - 3].orient[c];
if( nvF == 3 && deg == 2 ) return MB_SUCCESS;
if( ( nvF == 3 && deg == 3 ) || ( nvF == 4 && deg == 2 ) )
{
vidx.push_back( 1 );
}
else if( nvF == 4 && deg == 3 )
{
for( int i = 0; i < 4; i++ )
vidx.push_back( permutation[nvF - 3].porder2[c][i] );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::reorder_indices | ( | int | deg, |
| int | nvF, | ||
| int | comb, | ||
| int * | childfid_map | ||
| ) | [protected] |
Definition at line 4455 of file NestedRefine.cpp.
References MB_SUCCESS, and permutation.
{
// Given connectivities of two faces and a degree, get the permuted indices of the children
// faces w.r.t first face.
assert( deg == 2 || deg == 3 );
// Get the ordered indices
if( deg == 2 )
{
for( int i = 0; i < 4; i++ )
childfid_map[i] = permutation[nvF - 3].porder2[comb][i];
}
else
{
for( int i = 0; i < 9; i++ )
childfid_map[i] = permutation[nvF - 3].porder3[comb][i];
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::reorder_indices | ( | EntityHandle * | face1_conn, |
| EntityHandle * | face2_conn, | ||
| int | nvF, | ||
| int * | conn_map, | ||
| int & | comb, | ||
| int * | orient = NULL |
||
| ) | [protected] |
Definition at line 4477 of file NestedRefine.cpp.
References moab::NestedRefine::pmat::comb, MB_SET_ERR, MB_SUCCESS, moab::NestedRefine::pmat::num_comb, moab::NestedRefine::pmat::orient, and permutation.
{
// Given connectivities of two faces and a degree, get the permuted indices of the children
// faces w.r.t first face.
// Step 1: First find the combination
int nco = permutation[nvF - 3].num_comb;
int c = 0;
for( int i = 0; i < nco; i++ )
{
int count = 0;
for( int j = 0; j < nvF; j++ )
{
int id = permutation[nvF - 3].comb[i][j];
if( face1_conn[j] == face2_conn[id] ) count += 1;
}
if( count == nvF )
{
c = i;
break;
}
}
if( c > nco ) MB_SET_ERR( MB_FAILURE, "Getting a combination number more than currently supported" );
comb = c;
if( orient ) orient[0] = permutation[nvF - 3].orient[c];
for( int j = 0; j < nvF; j++ )
{
conn_map[j] = permutation[nvF - 3].comb[c][j];
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::subdivide_cells | ( | EntityType | type, |
| int | cur_level, | ||
| int | deg | ||
| ) | [protected] |
Definition at line 1421 of file NestedRefine.cpp.
References _incells, _infaces, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::level_memory::cell_conn, compute_coordinates(), construct_hm_1D(), construct_hm_2D(), moab::Range::empty(), moab::NestedRefine::refPatterns::ents_conn, moab::error(), ErrorCode, get_connectivity(), get_coordinates(), get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SUCCESS, moab::NestedRefine::level_memory::num_cells, moab::HalfFacetRep::LocalMaps3D::num_edges_in_cell, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, moab::NestedRefine::level_memory::num_verts, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::NestedRefine::refPatterns::nv_edge, moab::NestedRefine::refPatterns::nv_face, refTemplates, moab::Range::size(), moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::NestedRefine::refPatterns::total_new_verts, update_global_ahf(), update_local_ahf(), update_tracking_verts(), moab::NestedRefine::refPatterns::vert_on_edges, and moab::NestedRefine::refPatterns::vert_on_faces.
Referenced by construct_hm_3D().
{
ErrorCode error;
int nverts_prev, nents_prev;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_cells;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _incells.size();
}
// Create some book-keeping arrays over the parent mesh to avoid introducing duplicate vertices
int cindex = type - 1;
int d = get_index_from_degree( deg );
int ne = refTemplates[cindex][d].nv_edge;
int nvf = refTemplates[cindex][d].nv_face;
int nvtotal = refTemplates[cindex][d].total_new_verts;
int index = ahf->get_index_in_lmap( *( _incells.begin() ) );
int nvpc = ahf->lConnMap3D[index].num_verts_in_cell;
int nepc = ahf->lConnMap3D[index].num_edges_in_cell;
int nfpc = ahf->lConnMap3D[index].num_faces_in_cell;
int vtotal = nvpc + nvtotal;
std::vector< EntityHandle > vbuffer( vtotal );
std::vector< EntityHandle > trackvertsC_edg( nepc * ne * nents_prev, 0 );
std::vector< EntityHandle > trackvertsC_face( nfpc * nvf * nents_prev, 0 );
int cur_nverts = level_mesh[cur_level].num_verts;
std::vector< int > flag_verts( cur_nverts - nverts_prev, 0 );
int count_nverts = nverts_prev;
int count_ents = 0;
std::vector< EntityHandle > conn, cur_conn;
// Step 1: Create the subentities via refinement of the previous mesh
for( int cid = 0; cid < nents_prev; cid++ )
{
conn.clear();
cur_conn.clear();
for( int i = 0; i < vtotal; i++ )
vbuffer[i] = 0;
// EntityHandle of the working cell
EntityHandle cell;
if( cur_level )
cell = level_mesh[cur_level - 1].start_cell + cid;
else
cell = _incells[cid];
error = get_connectivity( cell, cur_level, conn );MB_CHK_ERR( error );
// Step 1: Add vertices from the current level for the working face that will be used for
// subdivision.
// Add the corners to vbuffer
for( int i = 0; i < (int)conn.size(); i++ )
{
if( cur_level )
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - level_mesh[cur_level - 1].start_vertex );
else
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - *_inverts.begin() );
cur_conn.push_back( vbuffer[i] );
}
// Gather vertices already added to tracking array due to refinement of the sibling cells
for( int i = 0; i < nepc; i++ )
{
for( int j = 0; j < ne; j++ )
{
int idx = refTemplates[cindex][d].vert_on_edges[i][j];
vbuffer[idx] = trackvertsC_edg[cid * nepc * ne + ne * i + j];
}
}
// Add remaining new vertex handles
for( int i = 0; i < nfpc; i++ )
{
for( int j = 0; j < nvf; j++ )
{
int idx = refTemplates[cindex][d].vert_on_faces[i][j];
vbuffer[idx] = trackvertsC_face[cid * nfpc * nvf + nvf * i + j];
}
}
// Add the remaining vertex handles to vbuffer for the current level for the working cell
for( int i = 0; i < nvtotal; i++ )
{
if( !vbuffer[i + nvpc] )
{
vbuffer[i + nvpc] = level_mesh[cur_level].start_vertex + count_nverts;
count_nverts += 1;
}
}
// Step 2: Use the template to obtain the subentities. The coordinates and local ahf maps
// are also constructed. Connectivity of the children
int etotal = refTemplates[type - 1][d].total_new_ents;
std::vector< EntityHandle > ent_buffer( etotal );
for( int i = 0; i < etotal; i++ )
{
for( int k = 0; k < nvpc; k++ )
{
int idx = refTemplates[type - 1][d].ents_conn[i][k];
level_mesh[cur_level].cell_conn[nvpc * count_ents + k] = vbuffer[idx];
}
ent_buffer[i] = level_mesh[cur_level].start_cell + count_ents;
count_ents += 1;
}
// Step 3: Update local ahf maps
error = update_local_ahf( deg, type, &vbuffer[0], &ent_buffer[0], etotal );MB_CHK_ERR( error );
// Step 4: Update tracking information
error = update_tracking_verts( cell, cur_level, deg, trackvertsC_edg, trackvertsC_face, &vbuffer[0] );MB_CHK_ERR( error );
// Step 5: Coordinates of the new vertices
std::vector< double > corner_coords( nvpc * 3 );
error = get_coordinates( &cur_conn[0], nvpc, cur_level + 1, &corner_coords[0] );MB_CHK_ERR( error );
error = compute_coordinates( cur_level, deg, type, &vbuffer[0], vtotal, &corner_coords[0], flag_verts,
nverts_prev );MB_CHK_ERR( error );
}
// error = ahf->print_tags(3);
// Step 6: Update the global maps
error = update_global_ahf( type, cur_level, deg );MB_CHK_ERR( error );
// Step 7: If edges exists, refine them as well.
if( level_mesh[cur_level].num_edges != 0 )
{
error = construct_hm_1D( cur_level, deg, type, trackvertsC_edg );MB_CHK_ERR( error );
}
// Step 8: If faces exists, refine them as well.
if( !_infaces.empty() )
{
error = construct_hm_2D( cur_level, deg, type, trackvertsC_edg, trackvertsC_face );MB_CHK_ERR( error );
}
// error = ahf->print_tags(3);
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::subdivide_tets | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 1573 of file NestedRefine.cpp.
References _incells, _infaces, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::level_memory::cell_conn, compute_coordinates(), construct_hm_1D(), construct_hm_2D(), moab::Range::empty(), moab::NestedRefine::refPatterns::ents_conn, moab::error(), ErrorCode, find_shortest_diagonal_octahedron(), get_connectivity(), get_coordinates(), get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SUCCESS, MBTET, moab::NestedRefine::level_memory::num_cells, moab::HalfFacetRep::LocalMaps3D::num_edges_in_cell, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, moab::NestedRefine::level_memory::num_verts, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::NestedRefine::refPatterns::nv_edge, moab::NestedRefine::refPatterns::nv_face, refTemplates, moab::Range::size(), moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::NestedRefine::refPatterns::total_new_verts, update_global_ahf(), update_local_ahf(), update_tracking_verts(), moab::NestedRefine::refPatterns::vert_on_edges, and moab::NestedRefine::refPatterns::vert_on_faces.
Referenced by construct_hm_3D().
{
ErrorCode error;
int nverts_prev, nents_prev;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_cells;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _incells.size();
}
EntityType type = MBTET;
int cindex = type - 1;
int d = get_index_from_degree( deg );
int ne = refTemplates[cindex][d].nv_edge;
int nvf = refTemplates[cindex][d].nv_face;
int nvtotal = refTemplates[cindex][d].total_new_verts;
int index = ahf->get_index_in_lmap( *( _incells.begin() ) );
int nvpc = ahf->lConnMap3D[index].num_verts_in_cell;
int nepc = ahf->lConnMap3D[index].num_edges_in_cell;
int nfpc = ahf->lConnMap3D[index].num_faces_in_cell;
// Create vertex buffer
int vtotal = nvpc + nvtotal;
std::vector< EntityHandle > vbuffer( vtotal );
// Create book-keeping arrays over the parent mesh to avoid introducing duplicate vertices
std::vector< EntityHandle > trackvertsC_edg( nepc * ne * nents_prev, 0 );
std::vector< EntityHandle > trackvertsC_face( nfpc * nvf * nents_prev, 0 );
int cur_nverts = level_mesh[cur_level].num_verts;
std::vector< int > flag_verts( cur_nverts - nverts_prev, 0 );
std::vector< int > cell_patterns( nents_prev, 0 );
int count_nverts = nverts_prev;
int count_ents = 0;
std::vector< EntityHandle > conn, cur_conn;
// Step 1: Create the subentities via refinement of the previous mesh
for( int cid = 0; cid < nents_prev; cid++ )
{
conn.clear();
cur_conn.clear();
for( int i = 0; i < vtotal; i++ )
vbuffer[i] = 0;
// EntityHandle of the working cell
EntityHandle cell;
if( cur_level )
cell = level_mesh[cur_level - 1].start_cell + cid;
else
cell = _incells[cid];
error = get_connectivity( cell, cur_level, conn );MB_CHK_ERR( error );
// Step 1: Add vertices from the current level for the working face that will be used for
// subdivision.
// Add the corners to vbuffer
for( int i = 0; i < (int)conn.size(); i++ )
{
if( cur_level )
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - level_mesh[cur_level - 1].start_vertex );
else
vbuffer[i] = level_mesh[cur_level].start_vertex + ( conn[i] - *_inverts.begin() );
cur_conn.push_back( vbuffer[i] );
}
// Gather vertices already added to tracking array due to refinement of the sibling cells
for( int i = 0; i < nepc; i++ )
{
for( int j = 0; j < ne; j++ )
{
int idx = refTemplates[cindex][d].vert_on_edges[i][j];
vbuffer[idx] = trackvertsC_edg[cid * nepc * ne + ne * i + j];
}
}
// Add remaining new vertex handles
for( int i = 0; i < nfpc; i++ )
{
for( int j = 0; j < nvf; j++ )
{
int idx = refTemplates[cindex][d].vert_on_faces[i][j];
vbuffer[idx] = trackvertsC_face[cid * nfpc * nvf + nvf * i + j];
}
}
// Add the remaining vertex handles to vbuffer for the current level for the working cell
for( int i = 0; i < nvtotal; i++ )
{
if( !vbuffer[i + nvpc] )
{
vbuffer[i + nvpc] = level_mesh[cur_level].start_vertex + count_nverts;
count_nverts += 1;
}
}
// Step 2: Coordinates of the new vertices
std::vector< double > corner_coords( nvpc * 3 );
error = get_coordinates( &cur_conn[0], nvpc, cur_level + 1, &corner_coords[0] );MB_CHK_ERR( error );
error = compute_coordinates( cur_level, deg, type, &vbuffer[0], vtotal, &corner_coords[0], flag_verts,
nverts_prev );MB_CHK_ERR( error );
// Step 3: Choose the tet refine pattern to be used for this tet
int diag = find_shortest_diagonal_octahedron( cur_level, deg, &vbuffer[0] );
int pat_id = diag + 2;
cell_patterns[cid] = pat_id;
// Step 4: Use the template to obtain the subentities. The coordinates and local ahf maps
// are also constructed. Connectivity of the children
int etotal = refTemplates[pat_id][d].total_new_ents;
std::vector< EntityHandle > ent_buffer( etotal );
for( int i = 0; i < etotal; i++ )
{
for( int k = 0; k < nvpc; k++ )
{
int idx = refTemplates[pat_id][d].ents_conn[i][k];
level_mesh[cur_level].cell_conn[nvpc * count_ents + k] = vbuffer[idx];
}
ent_buffer[i] = level_mesh[cur_level].start_cell + count_ents;
count_ents += 1;
}
// Step 5: Update local ahf maps
error = update_local_ahf( deg, MBTET, pat_id, &vbuffer[0], &ent_buffer[0], etotal );MB_CHK_ERR( error );
// Step 6: Update tracking information
error = update_tracking_verts( cell, cur_level, deg, trackvertsC_edg, trackvertsC_face, &vbuffer[0] );MB_CHK_ERR( error );
}
// Step 7: Update the global maps
// error = update_global_ahf(cur_level, deg, cell_patterns); MB_CHK_ERR(error);
error = update_global_ahf( type, cur_level, deg, &cell_patterns );MB_CHK_ERR( error );
// Step 8: If edges exists, refine them as well.
if( level_mesh[cur_level].num_edges != 0 )
{
error = construct_hm_1D( cur_level, deg, type, trackvertsC_edg );MB_CHK_ERR( error );
}
// Step 9: If faces exists, refine them as well.
if( !_infaces.empty() )
{
error = construct_hm_2D( cur_level, deg, type, trackvertsC_edg, trackvertsC_face );MB_CHK_ERR( error );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_ahf_1D | ( | int | cur_level | ) | [protected] |
Definition at line 3398 of file NestedRefine.cpp.
References ahf, moab::HalfFacetRep::determine_incident_halfverts(), moab::HalfFacetRep::determine_sibling_halfverts(), moab::error(), ErrorCode, level_mesh, MB_CHK_ERR, and MB_SUCCESS.
Referenced by construct_hm_2D().
{
ErrorCode error;
error = ahf->determine_sibling_halfverts( level_mesh[cur_level].verts, level_mesh[cur_level].edges );MB_CHK_ERR( error );
error = ahf->determine_incident_halfverts( level_mesh[cur_level].edges );MB_CHK_ERR( error );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_global_ahf | ( | EntityType | type, |
| int | cur_level, | ||
| int | deg, | ||
| std::vector< int > * | pattern_ids = NULL |
||
| ) | [protected] |
Definition at line 3113 of file NestedRefine.cpp.
References moab::error(), ErrorCode, MB_CHK_ERR, MB_NOT_IMPLEMENTED, MB_SET_ERR, MB_SUCCESS, MBEDGE, MBHEX, MBQUAD, MBTET, MBTRI, update_global_ahf_1D(), update_global_ahf_2D(), and update_global_ahf_3D().
Referenced by construct_hm_1D(), construct_hm_2D(), subdivide_cells(), and subdivide_tets().
{
ErrorCode error;
// Get the number of half-facets and number of children of each type
if( type == MBEDGE )
{
assert( pattern_ids == NULL );
error = update_global_ahf_1D( cur_level, deg );MB_CHK_ERR( error );
}
else if( type == MBTRI || type == MBQUAD )
{
assert( pattern_ids == NULL );
error = update_global_ahf_2D( cur_level, deg );MB_CHK_ERR( error );
}
else if( type == MBHEX )
{
assert( pattern_ids == NULL );
error = update_global_ahf_3D( cur_level, deg );MB_CHK_ERR( error );
}
else if( type == MBTET )
{
assert( pattern_ids != NULL );
error = update_global_ahf_3D( cur_level, deg, pattern_ids );MB_CHK_ERR( error );
}
else
MB_SET_ERR( MB_NOT_IMPLEMENTED, "Requesting AHF update for an unsupported mesh entity type" );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_global_ahf_1D | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 3153 of file NestedRefine.cpp.
References _inedges, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::refPatterns::ents_on_pent, moab::error(), ErrorCode, moab::HalfFacetRep::get_incident_map(), get_index_from_degree(), get_local_vid(), moab::HalfFacetRep::get_sibling_map(), level_mesh, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, MBEDGE, moab::NestedRefine::level_memory::num_edges, moab::NestedRefine::level_memory::num_verts, refTemplates, moab::HalfFacetRep::set_incident_map(), moab::HalfFacetRep::set_sibling_map(), moab::Range::size(), moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, and moab::NestedRefine::refPatterns::v2hf.
Referenced by update_global_ahf().
{
ErrorCode error;
int d = get_index_from_degree( deg );
int nhf, nchilds, nverts_prev, nents_prev;
nhf = 2;
nchilds = refTemplates[0][d].total_new_ents;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_edges;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _inedges.size();
}
std::vector< EntityHandle > inci_ent, child_ents;
std::vector< int > inci_lid, child_lids;
// Update the vertex to half-facet maps for duplicate vertices
for( int i = 0; i < nverts_prev; i++ )
{
inci_ent.clear();
inci_lid.clear();
child_ents.clear();
child_lids.clear();
// Vertex id in the previous mesh and the current one
EntityHandle vid;
if( cur_level )
vid = level_mesh[cur_level - 1].start_vertex + i;
else
vid = _inverts[i];
EntityHandle cur_vid = level_mesh[cur_level].start_vertex + i;
// Get the incident half-vert in the previous mesh
error = ahf->get_incident_map( MBEDGE, vid, inci_ent, inci_lid );MB_CHK_ERR( error );
// Obtain the corresponding incident child in the current mesh
int lvid = get_local_vid( vid, inci_ent[0], cur_level - 1 );
if( lvid < 0 ) MB_SET_ERR( MB_FAILURE, "did not find local vertex ix " );
int chid = refTemplates[0][d].v2hf[lvid][0] - 1;
int pid;
if( cur_level )
pid = inci_ent[0] - level_mesh[cur_level - 1].start_edge;
else
pid = inci_ent[0] - *_inedges.begin();
int ind = nchilds * pid;
child_ents.push_back( level_mesh[cur_level].start_edge + ind + chid );
child_lids.push_back( refTemplates[0][d].v2hf[lvid][1] );
error = ahf->set_incident_map( MBEDGE, cur_vid, child_ents, child_lids );MB_CHK_ERR( error );
}
// Update the sibling half-facet maps across entities
for( int i = 0; i < nents_prev; i++ )
{
EntityHandle ent;
if( cur_level )
ent = level_mesh[cur_level - 1].start_edge + i;
else
ent = _inedges[i];
std::vector< EntityHandle > sib_entids( nhf );
std::vector< int > sib_lids( nhf );
error = ahf->get_sibling_map( MBEDGE, ent, &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
int id, idx;
for( int l = 0; l < nhf; l++ )
{
if( !sib_entids[l] ) continue;
// Find the child incident on the half-facet
id = refTemplates[0][d].ents_on_pent[l][1] - 1;
idx = nchilds * i;
EntityHandle child_ent = level_mesh[cur_level].start_edge + idx + id;
int ch_lid = l;
// Find the sibling of the child
std::vector< EntityHandle > sib_childs( nhf );
std::vector< int > sib_chlids( nhf );
error = ahf->get_sibling_map( MBEDGE, child_ent, &sib_childs[0], &sib_chlids[0], nhf );MB_CHK_ERR( error );
// If the sibling already exists, dont do anything
if( sib_childs[ch_lid] ) continue;
// Get the correponding child of the sibling of the current parent
int psib;
if( cur_level )
psib = sib_entids[l] - level_mesh[cur_level - 1].start_edge;
else
psib = sib_entids[l] - *_inedges.begin();
int plid = sib_lids[l];
id = refTemplates[0][d].ents_on_pent[plid][1] - 1;
idx = nchilds * psib;
EntityHandle psib_child = level_mesh[cur_level].start_edge + idx + id;
int psib_chlid = plid;
// Set the siblings
sib_childs[ch_lid] = psib_child;
sib_chlids[ch_lid] = psib_chlid;
error = ahf->set_sibling_map( MBEDGE, child_ent, &sib_childs[0], &sib_chlids[0], nhf );MB_CHK_ERR( error );
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_global_ahf_1D_sub | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 3273 of file NestedRefine.cpp.
References _inedges, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::refPatterns::ents_on_pent, moab::error(), ErrorCode, get_connectivity(), moab::HalfFacetRep::get_incident_map(), get_index_from_degree(), get_local_vid(), moab::HalfFacetRep::get_sibling_map(), level_mesh, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, MBEDGE, moab::NestedRefine::level_memory::num_edges, refTemplates, moab::HalfFacetRep::set_incident_map(), moab::HalfFacetRep::set_sibling_map(), moab::Range::size(), moab::NestedRefine::level_memory::start_edge, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, and moab::NestedRefine::refPatterns::v2hf.
Referenced by construct_hm_1D().
{
ErrorCode error;
int d = get_index_from_degree( deg );
int nhf, nchilds, nents_prev;
nhf = 2;
nchilds = refTemplates[0][d].total_new_ents;
if( cur_level )
{
nents_prev = level_mesh[cur_level - 1].num_edges;
}
else
{
nents_prev = _inedges.size();
}
// Update the sibling half-facet maps across entities
std::vector< EntityHandle > conn;
for( int i = 0; i < nents_prev; i++ )
{
EntityHandle ent;
if( cur_level )
ent = level_mesh[cur_level - 1].start_edge + i;
else
ent = _inedges[i];
// Set incident hv maps
conn.clear();
error = get_connectivity( ent, cur_level, conn );MB_CHK_ERR( error );
std::vector< EntityHandle > inci_ent, child_ents;
std::vector< int > inci_lid, child_lids;
for( int j = 0; j < 2; j++ )
{
inci_ent.clear();
inci_lid.clear();
child_ents.clear();
child_lids.clear();
// Get the entityhandle of the vertex from previous level in the current level
EntityHandle cur_vid;
if( cur_level )
cur_vid = level_mesh[cur_level].start_vertex + ( conn[j] - level_mesh[cur_level - 1].start_vertex );
else
cur_vid = level_mesh[cur_level].start_vertex + ( conn[j] - *_inverts.begin() );
// Obtain the incident half-facet. If exists, then no need to assign another
error = ahf->get_incident_map( MBEDGE, cur_vid, inci_ent, inci_lid );MB_CHK_ERR( error );
if( inci_ent[0] != 0 ) continue;
// Get the incident half-facet on the old vertex
error = ahf->get_incident_map( MBEDGE, conn[j], inci_ent, inci_lid );MB_CHK_ERR( error );
// Obtain the corresponding incident child in the current mesh
int lvid = get_local_vid( conn[j], inci_ent[0], cur_level - 1 );
if( lvid < 0 ) MB_SET_ERR( MB_FAILURE, "did not find local vertex ix " );
int chid = refTemplates[0][d].v2hf[lvid][0] - 1;
int pid;
if( cur_level )
pid = inci_ent[0] - level_mesh[cur_level - 1].start_edge;
else
pid = inci_ent[0] - *_inedges.begin();
int ind = nchilds * pid;
child_ents.push_back( level_mesh[cur_level].start_edge + ind + chid );
child_lids.push_back( refTemplates[0][d].v2hf[lvid][1] );
error = ahf->set_incident_map( MBEDGE, cur_vid, child_ents, child_lids );MB_CHK_ERR( error );
}
std::vector< EntityHandle > sib_entids( nhf );
std::vector< int > sib_lids( nhf );
error = ahf->get_sibling_map( MBEDGE, ent, &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
int id, idx;
for( int l = 0; l < nhf; l++ )
{
if( !sib_entids[l] ) continue;
// Find the child incident on the half-facet
id = refTemplates[0][d].ents_on_pent[l][1] - 1;
idx = nchilds * i;
EntityHandle child_ent = level_mesh[cur_level].start_edge + idx + id;
int ch_lid = l;
// Find the sibling of the child
std::vector< EntityHandle > sib_childs( nhf );
std::vector< int > sib_chlids( nhf );
error = ahf->get_sibling_map( MBEDGE, child_ent, &sib_childs[0], &sib_chlids[0], nhf );MB_CHK_ERR( error );
// If the sibling already exists, dont do anything
if( sib_childs[ch_lid] ) continue;
// Get the correponding child of the sibling of the current parent
int psib;
if( cur_level )
psib = sib_entids[l] - level_mesh[cur_level - 1].start_edge;
else
psib = sib_entids[l] - *_inedges.begin();
int plid = sib_lids[l];
id = refTemplates[0][d].ents_on_pent[plid][1] - 1;
idx = nchilds * psib;
EntityHandle psib_child = level_mesh[cur_level].start_edge + idx + id;
int psib_chlid = plid;
// Set the siblings
sib_childs[ch_lid] = psib_child;
sib_chlids[ch_lid] = psib_chlid;
error = ahf->set_sibling_map( MBEDGE, child_ent, &sib_childs[0], &sib_chlids[0], nhf );MB_CHK_ERR( error );
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_global_ahf_2D | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 3408 of file NestedRefine.cpp.
References _infaces, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::refPatterns::ents_on_pent, moab::error(), ErrorCode, get_connectivity(), moab::HalfFacetRep::get_incident_map(), get_index_from_degree(), get_local_vid(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::lConnMap2D, level_mesh, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, mbImpl, moab::HalfFacetRep::LocalMaps2D::next, moab::NestedRefine::level_memory::num_faces, moab::NestedRefine::level_memory::num_verts, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, refTemplates, moab::HalfFacetRep::set_incident_map(), moab::HalfFacetRep::set_sibling_map(), moab::Range::size(), moab::NestedRefine::level_memory::start_face, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::Core::type_from_handle(), and moab::NestedRefine::refPatterns::v2hf.
Referenced by update_global_ahf().
{
ErrorCode error;
EntityType type = mbImpl->type_from_handle( *_infaces.begin() );
int nhf, nchilds, nverts_prev, nents_prev;
nhf = ahf->lConnMap2D[type - 2].num_verts_in_face;
int d = get_index_from_degree( deg );
nchilds = refTemplates[type - 1][d].total_new_ents;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_faces;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _infaces.size();
}
std::vector< EntityHandle > inci_ent, child_ents;
std::vector< int > inci_lid, child_lids;
// Update the vertex to half-edge maps for old/duplicate vertices
for( int i = 0; i < nverts_prev; i++ )
{
inci_ent.clear();
inci_lid.clear();
child_ents.clear();
child_lids.clear();
// Vertex id in the previous mesh
EntityHandle vid;
if( cur_level )
vid = level_mesh[cur_level - 1].start_vertex + i;
else
vid = _inverts[i];
EntityHandle cur_vid = level_mesh[cur_level].start_vertex + i;
// Get the incident half-vert in the previous mesh
error = ahf->get_incident_map( type, vid, inci_ent, inci_lid );MB_CHK_ERR( error );
// Obtain the corresponding incident child in the current mesh
for( int j = 0; j < (int)inci_ent.size(); j++ )
{
int lvid = get_local_vid( vid, inci_ent[j], cur_level - 1 );
if( lvid < 0 ) MB_SET_ERR( MB_FAILURE, "did not find local vertex ix " );
int chid = refTemplates[type - 1][d].v2hf[lvid][0] - 1;
int pid;
if( cur_level )
pid = inci_ent[j] - level_mesh[cur_level - 1].start_face;
else
pid = inci_ent[j] - *_infaces.begin();
int ind = nchilds * pid;
child_ents.push_back( level_mesh[cur_level].start_face + ind + chid );
child_lids.push_back( refTemplates[type - 1][d].v2hf[lvid][1] );
}
error = ahf->set_incident_map( type, cur_vid, child_ents, child_lids );MB_CHK_ERR( error );
}
EntityHandle fedge[2];
// Update the sibling half-facet maps across entities
for( int i = 0; i < nents_prev; i++ )
{
EntityHandle ent;
if( cur_level )
ent = level_mesh[cur_level - 1].start_face + i;
else
ent = _infaces[i];
std::vector< EntityHandle > fid_conn;
error = get_connectivity( ent, cur_level, fid_conn );
if( MB_SUCCESS != error ) return error;
std::vector< EntityHandle > sib_entids( nhf );
std::vector< int > sib_lids( nhf );
error = ahf->get_sibling_map( type, ent, &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
int id, idx;
for( int l = 0; l < nhf; l++ )
{
if( !sib_entids[l] ) continue;
int nidx = ahf->lConnMap2D[type - 2].next[l];
fedge[0] = fid_conn[l];
fedge[1] = fid_conn[nidx];
EntityHandle sfid = sib_entids[l];
int slid = sib_lids[l];
std::vector< EntityHandle > conn;
error = get_connectivity( sfid, cur_level, conn );
if( MB_SUCCESS != error ) return error;
bool orient = true;
nidx = ahf->lConnMap2D[type - 2].next[slid];
if( ( fedge[1] == conn[slid] ) && ( fedge[0] == conn[nidx] ) ) orient = false;
if( orient ) assert( ( fedge[0] == conn[slid] ) && ( fedge[1] == conn[nidx] ) );
// Find the childrens incident on the half-facet
int nch = refTemplates[type - 1][d].ents_on_pent[l][0];
idx = nchilds * i;
// Loop over all the incident childrens
for( int k = 0; k < nch; k++ )
{
id = refTemplates[type - 1][d].ents_on_pent[l][k + 1] - 1;
EntityHandle child_ent = level_mesh[cur_level].start_face + idx + id;
int child_lid = l;
// Find the sibling of the child
EntityHandle child_sibent;
int child_siblid;
error = ahf->get_sibling_map( type, child_ent, child_lid, child_sibent, child_siblid );MB_CHK_ERR( error );
if( child_sibent != 0 ) continue;
// Get the correponding child of the sibling of the current parent
int psib;
if( cur_level )
psib = sfid - level_mesh[cur_level - 1].start_face;
else
psib = sfid - *_infaces.begin();
int plid = slid;
if( orient )
id = refTemplates[type - 1][d].ents_on_pent[plid][k + 1] - 1;
else
id = refTemplates[type - 1][d].ents_on_pent[plid][nch - k] - 1;
int sidx = nchilds * psib;
EntityHandle psib_child = level_mesh[cur_level].start_face + sidx + id;
int psib_chlid = plid;
// Set the siblings
error = ahf->set_sibling_map( type, child_ent, child_lid, psib_child, psib_chlid );MB_CHK_ERR( error );
}
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_global_ahf_2D_sub | ( | int | cur_level, |
| int | deg | ||
| ) | [protected] |
Definition at line 3562 of file NestedRefine.cpp.
References _infaces, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::refPatterns::ents_on_pent, moab::error(), ErrorCode, get_connectivity(), moab::HalfFacetRep::get_incident_map(), get_index_from_degree(), get_local_vid(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::lConnMap2D, level_mesh, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, mbImpl, moab::HalfFacetRep::LocalMaps2D::next, moab::NestedRefine::level_memory::num_faces, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, refTemplates, moab::HalfFacetRep::set_incident_map(), moab::HalfFacetRep::set_sibling_map(), moab::Range::size(), moab::NestedRefine::level_memory::start_face, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::Core::type_from_handle(), and moab::NestedRefine::refPatterns::v2hf.
Referenced by construct_hm_2D().
{
ErrorCode error;
int d = get_index_from_degree( deg );
EntityType type = mbImpl->type_from_handle( *_infaces.begin() );
int nhf, nchilds, nents_prev;
nhf = ahf->lConnMap2D[type - 2].num_verts_in_face;
nchilds = refTemplates[type - 1][d].total_new_ents;
if( cur_level )
nents_prev = level_mesh[cur_level - 1].num_faces;
else
nents_prev = _infaces.size();
EntityHandle fedge[2];
// Update the sibling half-facet maps across entities
for( int i = 0; i < nents_prev; i++ )
{
EntityHandle ent;
if( cur_level )
ent = level_mesh[cur_level - 1].start_face + i;
else
ent = _infaces[i];
std::vector< EntityHandle > fid_conn;
error = get_connectivity( ent, cur_level, fid_conn );
if( MB_SUCCESS != error ) return error;
std::vector< EntityHandle > inci_ent, child_ents;
std::vector< int > inci_lid, child_lids;
// Set incident half-edges
for( int j = 0; j < nhf; j++ )
{
inci_ent.clear();
inci_lid.clear();
child_ents.clear();
child_lids.clear();
EntityHandle cur_vid;
if( cur_level )
cur_vid = level_mesh[cur_level].start_vertex + ( fid_conn[j] - level_mesh[cur_level - 1].start_vertex );
else
cur_vid = level_mesh[cur_level].start_vertex + ( fid_conn[j] - *_inverts.begin() );
// Obtain the incident half-facet. If exists, then no need to assign another
error = ahf->get_incident_map( type, cur_vid, inci_ent, inci_lid );MB_CHK_ERR( error );
if( inci_ent[0] != 0 ) continue;
// Get the incident half-facet on the old vertex
error = ahf->get_incident_map( type, fid_conn[j], inci_ent, inci_lid );MB_CHK_ERR( error );
// Obtain the corresponding incident child in the current mesh
for( int k = 0; k < (int)inci_ent.size(); k++ )
{
int lvid = get_local_vid( fid_conn[j], inci_ent[k], cur_level - 1 );
if( lvid < 0 ) MB_SET_ERR( MB_FAILURE, "did not find local vertex ix " );
int chid = refTemplates[type - 1][d].v2hf[lvid][0] - 1;
int pid;
if( cur_level )
pid = inci_ent[k] - level_mesh[cur_level - 1].start_face;
else
pid = inci_ent[k] - *_infaces.begin();
int ind = nchilds * pid;
child_ents.push_back( level_mesh[cur_level].start_face + ind + chid );
child_lids.push_back( refTemplates[type - 1][d].v2hf[lvid][1] );
}
error = ahf->set_incident_map( type, cur_vid, child_ents, child_lids );MB_CHK_ERR( error );
}
// Set sibling half-edges
std::vector< EntityHandle > sib_entids( nhf );
std::vector< int > sib_lids( nhf );
error = ahf->get_sibling_map( type, ent, &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
int id, idx;
for( int l = 0; l < nhf; l++ )
{
if( !sib_entids[l] ) continue;
int nidx = ahf->lConnMap2D[type - 2].next[l];
fedge[0] = fid_conn[l];
fedge[1] = fid_conn[nidx];
EntityHandle sfid = sib_entids[l];
int slid = sib_lids[l];
std::vector< EntityHandle > conn;
error = get_connectivity( sfid, cur_level, conn );MB_CHK_ERR( error );
assert( (int)conn.size() > nidx && (int)conn.size() > slid );
bool orient = true;
nidx = ahf->lConnMap2D[type - 2].next[slid];
if( ( fedge[1] == conn[slid] ) && ( fedge[0] == conn[nidx] ) ) orient = false;
if( orient ) assert( ( fedge[0] == conn[slid] ) && ( fedge[1] == conn[nidx] ) );
// Find the childrens incident on the half-facet
int nch = refTemplates[type - 1][d].ents_on_pent[l][0];
idx = nchilds * i;
// Loop over all the incident childrens
for( int k = 0; k < nch; k++ )
{
id = refTemplates[type - 1][d].ents_on_pent[l][k + 1] - 1;
EntityHandle child_ent = level_mesh[cur_level].start_face + idx + id;
int child_lid = l;
// Find the sibling of the child
EntityHandle child_sibent;
int child_siblid;
error = ahf->get_sibling_map( type, child_ent, child_lid, child_sibent, child_siblid );MB_CHK_ERR( error );
if( child_sibent != 0 ) continue;
// Get the correponding child of the sibling of the current parent
int psib;
if( cur_level )
psib = sfid - level_mesh[cur_level - 1].start_face;
else
psib = sfid - *_infaces.begin();
int plid = slid;
if( orient )
id = refTemplates[type - 1][d].ents_on_pent[plid][k + 1] - 1;
else
id = refTemplates[type - 1][d].ents_on_pent[plid][nch - k] - 1;
int sidx = nchilds * psib;
EntityHandle psib_child = level_mesh[cur_level].start_face + sidx + id;
int psib_chlid = plid;
// Set the siblings
error = ahf->set_sibling_map( type, child_ent, child_lid, psib_child, psib_chlid );MB_CHK_ERR( error );
}
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_global_ahf_3D | ( | int | cur_level, |
| int | deg, | ||
| std::vector< int > * | pattern_ids = NULL |
||
| ) | [protected] |
Definition at line 3712 of file NestedRefine.cpp.
References _incells, _inverts, ahf, moab::Range::begin(), moab::NestedRefine::level_memory::cells, moab::HalfFacetRep::check_nonmanifold_vertices(), moab::HalfFacetRep::LocalMaps3D::e2v, moab::NestedRefine::refPatterns::ents_on_pent, moab::NestedRefine::refPatterns::ents_on_vedge, moab::error(), ErrorCode, moab::Core::get_connectivity(), moab::HalfFacetRep::get_incident_map(), get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), get_local_vid(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::get_up_adjacencies_edg_3d_comp(), moab::Range::index(), moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SET_ERR, MB_SUCCESS, mbImpl, MBTET, moab::NestedRefine::level_memory::num_cells, moab::HalfFacetRep::LocalMaps3D::num_edges_in_cell, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, moab::NestedRefine::level_memory::num_verts, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::NestedRefine::refPatterns::nv_edge, refTemplates, reorder_indices(), moab::HalfFacetRep::set_incident_map(), moab::HalfFacetRep::set_sibling_map(), moab::Range::size(), moab::NestedRefine::level_memory::start_cell, moab::NestedRefine::level_memory::start_vertex, moab::NestedRefine::refPatterns::total_new_ents, moab::Core::type_from_handle(), and moab::NestedRefine::refPatterns::v2hf.
Referenced by update_global_ahf().
{
ErrorCode error;
int nvpc, ne, nhf, nchilds, nverts_prev, nents_prev;
EntityType type = mbImpl->type_from_handle( *_incells.begin() );
int index = ahf->get_index_in_lmap( *_incells.begin() );
int d = get_index_from_degree( deg );
nhf = ahf->lConnMap3D[index].num_faces_in_cell;
ne = ahf->lConnMap3D[index].num_edges_in_cell;
nvpc = ahf->lConnMap3D[index].num_verts_in_cell;
nchilds = refTemplates[type - 1][d].total_new_ents;
if( cur_level )
{
nverts_prev = level_mesh[cur_level - 1].num_verts;
nents_prev = level_mesh[cur_level - 1].num_cells;
}
else
{
nverts_prev = _inverts.size();
nents_prev = _incells.size();
}
std::vector< EntityHandle > inci_ent, child_ents;
std::vector< int > inci_lid, child_lids;
// Step 1: Update the V2HF maps for old/duplicate vertices
for( int i = 0; i < nverts_prev; i++ )
{
inci_ent.clear();
inci_lid.clear();
child_ents.clear();
child_lids.clear();
// Vertex id in the previous mesh
EntityHandle vid;
if( cur_level )
vid = level_mesh[cur_level - 1].start_vertex + i;
else
vid = _inverts[i];
EntityHandle cur_vid = level_mesh[cur_level].start_vertex + i;
// Get the incident half-vert in the previous mesh
error = ahf->get_incident_map( type, vid, inci_ent, inci_lid );MB_CHK_ERR( error );
// Obtain the corresponding incident child in the current mesh
for( int j = 0; j < (int)inci_ent.size(); j++ )
{
int lvid = get_local_vid( vid, inci_ent[j], cur_level - 1 );
if( lvid < 0 ) MB_SET_ERR( MB_FAILURE, "did not find local vertex ix " );
int chid = refTemplates[type - 1][d].v2hf[lvid][0] - 1;
int pid;
if( cur_level )
pid = inci_ent[j] - level_mesh[cur_level - 1].start_cell;
else
pid = inci_ent[j] - *_incells.begin();
int ind = nchilds * pid;
// EntityHandle child_ent = level_mesh[cur_level].start_cell + ind+chid ;
// int child_lid = refTemplates[type-1][d].v2hf[lvid][1];
child_ents.push_back( level_mesh[cur_level].start_cell + ind + chid );
child_lids.push_back( refTemplates[type - 1][d].v2hf[lvid][1] );
}
error = ahf->set_incident_map( type, cur_vid, child_ents, child_lids );MB_CHK_ERR( error );
}
// error = ahf->determine_incident_halffaces( level_mesh[cur_level].cells);MB_CHK_ERR(error);
// Step 2: Update SIBHFS maps
for( int i = 0; i < nents_prev; i++ )
{
EntityHandle ent;
if( cur_level )
ent = level_mesh[cur_level - 1].start_cell + i;
else
ent = _incells[i];
std::vector< EntityHandle > sib_entids( nhf );
std::vector< int > sib_lids( nhf );
error = ahf->get_sibling_map( type, ent, &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
int id, idx;
for( int l = 0; l < nhf; l++ )
{
if( !sib_entids[l] ) continue;
// Get the number of children incident on this half-face
int pat_id;
if( type == MBTET )
pat_id = ( *pattern_ids )[i];
else
pat_id = type - 1;
int nch = refTemplates[pat_id][d].ents_on_pent[l][0];
// Get the order of children indices incident on this half-face
std::vector< int > id_sib( nch );
for( int k = 0; k < nch; k++ )
id_sib[k] = 0;
error = reorder_indices( cur_level, deg, ent, l, sib_entids[l], sib_lids[l], 1, &id_sib[0] );MB_CHK_ERR( error );
// Get the parent index of the sibling cell
int psib;
if( cur_level )
psib = sib_entids[l] - level_mesh[cur_level - 1].start_cell;
else
psib = sib_entids[l] - *_incells.begin();
int plid = sib_lids[l];
int sidx = nchilds * psib;
int sibpat_id;
if( type == MBTET )
sibpat_id = ( *pattern_ids )[psib];
else
sibpat_id = type - 1;
// Loop over all the childs incident on the working half-face
idx = nchilds * i;
for( int k = 0; k < nch; k++ )
{
id = refTemplates[pat_id][d].ents_on_pent[l][k + 1] - 1;
EntityHandle child_ent = level_mesh[cur_level].start_cell + idx + id;
int child_lid = l;
// Find the sibling of the working child
EntityHandle child_sibent;
int child_siblid;
error = ahf->get_sibling_map( type, child_ent, child_lid, child_sibent, child_siblid );MB_CHK_ERR( error );
if( child_sibent != 0 ) continue;
// Get the correponding child of the sibling of the current parent
// We have already computed the order the children on incident corresponding to the
// working half-face
id = refTemplates[sibpat_id][d].ents_on_pent[plid][id_sib[k]] - 1;
EntityHandle psib_child = level_mesh[cur_level].start_cell + sidx + id;
int psib_chlid = plid;
// Set the siblings of children incident on current half-face
error = ahf->set_sibling_map( type, child_ent, child_lid, psib_child, psib_chlid );MB_CHK_ERR( error );
// Set the sibling of the sibling of the children to the children
error = ahf->set_sibling_map( type, psib_child, psib_chlid, child_ent, child_lid );MB_CHK_ERR( error );
}
}
// Loop over edges to check if there are any non-manifold edges. If there are then the v2hfs
// map should be updated for the new vertices on it.
const EntityHandle* conn;
error = mbImpl->get_connectivity( ent, conn, nvpc );MB_CHK_ERR( error );
int nv = refTemplates[type - 1][d].nv_edge; //#verts on each edge
for( int l = 0; l < ne; l++ )
{
id = ahf->lConnMap3D[index].e2v[l][0];
EntityHandle v_start = conn[id];
id = ahf->lConnMap3D[index].e2v[l][1];
EntityHandle v_end = conn[id];
bool visited = false;
std::vector< EntityHandle > inci_ent1, inci_ent2;
std::vector< int > inci_lid1, inci_lid2;
error = ahf->get_incident_map( type, v_start, inci_ent1, inci_lid1 );MB_CHK_ERR( error );
error = ahf->get_incident_map( type, v_end, inci_ent2, inci_lid2 );MB_CHK_ERR( error );
if( inci_ent1.size() > 1 && inci_ent2.size() > 1 )
{
std::vector< EntityHandle > cell_comps;
std::vector< int > leid_comps;
error = ahf->get_up_adjacencies_edg_3d_comp( ent, l, cell_comps, &leid_comps );MB_CHK_ERR( error );
int ncomps = cell_comps.size();
std::vector< EntityHandle > edgverts;
std::vector< EntityHandle > compchildents( nv * ncomps );
std::vector< int > compchildlfids( nv * ncomps );
for( int s = 0; s < nv * ncomps; s++ )
{
compchildents[s] = 0;
compchildlfids[s] = 0;
}
for( int j = 0; j < (int)cell_comps.size(); j++ )
{
int ind;
if( cur_level )
ind = level_mesh[cur_level - 1].cells.index( cell_comps[j] );
else
ind = _incells.index( cell_comps[j] );
for( int k = 0; k < nv; k++ )
{
int chid = refTemplates[type - 1][d].ents_on_vedge[leid_comps[j]][3 * k] - 1;
int lfid = refTemplates[type - 1][d].ents_on_vedge[leid_comps[j]][3 * k + 1];
int lvid = refTemplates[type - 1][d].ents_on_vedge[leid_comps[j]][3 * k + 2];
EntityHandle childcell = level_mesh[cur_level].start_cell + ind * nchilds + chid;
const EntityHandle* econn;
error = mbImpl->get_connectivity( childcell, econn, nvpc );MB_CHK_ERR( error );
EntityHandle vert = econn[lvid];
if( ahf->check_nonmanifold_vertices( type, vert ) )
{
visited = true;
break;
}
if( edgverts.empty() )
{
edgverts.push_back( vert );
compchildents[0] = childcell;
compchildlfids[0] = lfid;
}
else
{
std::vector< EntityHandle >::iterator it;
it = find( edgverts.begin(), edgverts.end(), vert );
int indx = it - edgverts.begin();
if( it == edgverts.end() )
{
edgverts.push_back( vert );
compchildents[k * ncomps] = childcell;
compchildlfids[k * ncomps] = lfid;
}
else
{
compchildents[indx * ncomps + j] = childcell;
compchildlfids[indx * ncomps + j] = lfid;
}
}
}
}
if( visited )
{
break;
}
// Set the incident half-facet map
for( int k = 0; k < nv; k++ )
{
std::vector< EntityHandle > set_childents;
std::vector< int > set_childlfids;
for( int j = 0; j < ncomps; j++ )
{
set_childents.push_back( compchildents[k * ncomps + j] );
set_childlfids.push_back( compchildlfids[k * ncomps + j] );
}
error = ahf->set_incident_map( type, edgverts[k], set_childents, set_childlfids );MB_CHK_ERR( error );
}
}
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_local_ahf | ( | int | deg, |
| EntityType | type, | ||
| EntityHandle * | vbuffer, | ||
| EntityHandle * | ent_buffer, | ||
| int | etotal | ||
| ) | [protected] |
Definition at line 3100 of file NestedRefine.cpp.
References moab::error(), ErrorCode, MB_CHK_ERR, MB_SUCCESS, and MBTET.
Referenced by construct_hm_1D(), construct_hm_2D(), subdivide_cells(), and subdivide_tets().
{
ErrorCode error;
assert( type != MBTET );
error = update_local_ahf( deg, type, type - 1, vbuffer, ent_buffer, etotal );MB_CHK_ERR( error );
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_local_ahf | ( | int | deg, |
| EntityType | type, | ||
| int | pat_id, | ||
| EntityHandle * | vbuffer, | ||
| EntityHandle * | ent_buffer, | ||
| int | etotal | ||
| ) | [protected] |
Definition at line 3005 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), moab::NestedRefine::refPatterns::ents_opphfs, moab::error(), ErrorCode, moab::HalfFacetRep::get_incident_map(), get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_sibling_map(), moab::HalfFacetRep::lConnMap2D, moab::HalfFacetRep::lConnMap3D, MB_CHK_ERR, MB_SUCCESS, MBEDGE, MBHEX, MBQUAD, MBTET, MBTRI, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, moab::HalfFacetRep::LocalMaps3D::num_verts_in_cell, moab::HalfFacetRep::LocalMaps2D::num_verts_in_face, refTemplates, moab::HalfFacetRep::set_incident_map(), moab::HalfFacetRep::set_sibling_map(), moab::NestedRefine::refPatterns::total_new_verts, and moab::NestedRefine::refPatterns::v2hf.
{
ErrorCode error;
int nhf = 0, nv = 0, total_new_verts = 0;
int d = get_index_from_degree( deg );
// Get the number of half-facets
if( type == MBEDGE )
{
nhf = 2;
nv = 2;
total_new_verts = refTemplates[0][d].total_new_verts;
}
else if( type == MBTRI || type == MBQUAD )
{
nhf = ahf->lConnMap2D[type - 2].num_verts_in_face;
nv = nhf;
total_new_verts = refTemplates[pat_id][d].total_new_verts;
}
else if( type == MBTET || type == MBHEX )
{
int index = ahf->get_index_in_lmap( *_incells.begin() );
nhf = ahf->lConnMap3D[index].num_faces_in_cell;
nv = ahf->lConnMap3D[index].num_verts_in_cell;
total_new_verts = refTemplates[pat_id][d].total_new_verts;
}
std::vector< EntityHandle > ent;
std::vector< int > lid;
// Update the vertex to half-facet map
for( int i = 0; i < total_new_verts; i++ )
{
ent.clear();
lid.clear();
EntityHandle vid = vbuffer[i + nv];
error = ahf->get_incident_map( type, vid, ent, lid );MB_CHK_ERR( error );
if( ent[0] ) continue;
int id = refTemplates[pat_id][d].v2hf[i + nv][0] - 1;
ent[0] = ent_buffer[id];
lid[0] = refTemplates[pat_id][d].v2hf[i + nv][1];
error = ahf->set_incident_map( type, vid, ent, lid );MB_CHK_ERR( error );
}
// Update the sibling half-facet map
for( int i = 0; i < etotal; i++ )
{
std::vector< EntityHandle > sib_entids( nhf );
std::vector< int > sib_lids( nhf );
error = ahf->get_sibling_map( type, ent_buffer[i], &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
for( int l = 0; l < nhf; l++ )
{
if( sib_entids[l] ) continue;
// Fill out the sibling values
int id = refTemplates[pat_id][d].ents_opphfs[i][2 * l];
if( id )
{
sib_entids[l] = ent_buffer[id - 1];
sib_lids[l] = refTemplates[pat_id][d].ents_opphfs[i][2 * l + 1];
}
else
{
sib_entids[l] = 0;
sib_lids[l] = 0;
}
}
error = ahf->set_sibling_map( type, ent_buffer[i], &sib_entids[0], &sib_lids[0], nhf );MB_CHK_ERR( error );
for( int l = 0; l < nhf; l++ )
{
if( sib_entids[l] )
{
EntityHandle set_entid = ent_buffer[i];
int set_lid = l;
error = ahf->set_sibling_map( type, sib_entids[l], sib_lids[l], set_entid, set_lid );MB_CHK_ERR( error );
}
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_special_tags | ( | int | level, |
| EntityHandle & | lset | ||
| ) |
Definition at line 496 of file NestedRefine.cpp.
References _rset, moab::Core::add_entities(), moab::Range::begin(), moab::Range::clear(), DIRICHLET_SET_TAG_NAME, moab::Range::end(), moab::error(), ErrorCode, moab::Core::get_connectivity(), moab::Core::get_entities_by_handle(), moab::Core::get_entities_by_type_and_tag(), MATERIAL_SET_TAG_NAME, MB_CHK_ERR, MB_SUCCESS, MB_TYPE_INTEGER, MBENTITYSET, mbImpl, MBVERTEX, NEUMANN_SET_TAG_NAME, nlevels, parent_to_child(), moab::Core::remove_entities(), moab::Core::tag_get_handle(), moab::Core::type_from_handle(), and vertex_to_entities_down().
{
assert( level > 0 && level < nlevels + 1 );
ErrorCode error;
std::vector< Tag > mtags( 3 );
error = mbImpl->tag_get_handle( MATERIAL_SET_TAG_NAME, 1, MB_TYPE_INTEGER, mtags[0] );MB_CHK_ERR( error );
error = mbImpl->tag_get_handle( DIRICHLET_SET_TAG_NAME, 1, MB_TYPE_INTEGER, mtags[1] );MB_CHK_ERR( error );
error = mbImpl->tag_get_handle( NEUMANN_SET_TAG_NAME, 1, MB_TYPE_INTEGER, mtags[2] );MB_CHK_ERR( error );
for( int i = 0; i < 3; i++ )
{
// Gather sets of a particular tag
Range sets;
error = mbImpl->get_entities_by_type_and_tag( _rset, MBENTITYSET, &mtags[i], NULL, 1, sets );MB_CHK_ERR( error );
// Loop over all sets, gather entities in each set and add their children at all levels to
// the set
Range set_ents;
Range::iterator set_it;
std::vector< EntityHandle > childs;
for( set_it = sets.begin(); set_it != sets.end(); ++set_it )
{
// Get the entities in the set, recursively
set_ents.clear();
childs.clear();
error = mbImpl->get_entities_by_handle( *set_it, set_ents, true );MB_CHK_ERR( error );
// Gather child entities at the input level
for( Range::iterator sit = set_ents.begin(); sit != set_ents.end(); sit++ )
{
EntityType type = mbImpl->type_from_handle( *sit );
if( type == MBVERTEX )
{
Range conn;
std::vector< EntityHandle > cents;
error = vertex_to_entities_down( *sit, 0, level, cents );MB_CHK_ERR( error );
error = mbImpl->get_connectivity( ¢s[0], (int)cents.size(), conn, true );MB_CHK_ERR( error );
childs.insert( childs.end(), cents.begin(), cents.end() );
}
else
{
error = parent_to_child( *sit, 0, level, childs );MB_CHK_ERR( error );
}
std::sort( childs.begin(), childs.end() );
childs.erase( std::unique( childs.begin(), childs.end() ), childs.end() );
// Add child entities to tagged sets
error = mbImpl->add_entities( *set_it, &childs[0], childs.size() );MB_CHK_ERR( error );
}
// Remove the coarse entities
error = mbImpl->remove_entities( *set_it, set_ents );MB_CHK_ERR( error );
// Add
error = mbImpl->add_entities( lset, &( *set_it ), 1 );MB_CHK_ERR( error );
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::update_tracking_verts | ( | EntityHandle | cid, |
| int | cur_level, | ||
| int | deg, | ||
| std::vector< EntityHandle > & | trackvertsC_edg, | ||
| std::vector< EntityHandle > & | trackvertsC_face, | ||
| EntityHandle * | vbuffer | ||
| ) | [protected] |
Definition at line 4196 of file NestedRefine.cpp.
References _incells, ahf, moab::Range::begin(), moab::error(), ErrorCode, get_index_from_degree(), moab::HalfFacetRep::get_index_in_lmap(), moab::HalfFacetRep::get_up_adjacencies_edg_3d(), moab::HalfFacetRep::get_up_adjacencies_face_3d(), moab::HalfFacetRep::lConnMap3D, level_mesh, MB_CHK_ERR, MB_SUCCESS, mbImpl, moab::HalfFacetRep::LocalMaps3D::num_edges_in_cell, moab::HalfFacetRep::LocalMaps3D::num_faces_in_cell, moab::NestedRefine::refPatterns::nv_edge, moab::NestedRefine::refPatterns::nv_face, refTemplates, reorder_indices(), moab::NestedRefine::level_memory::start_cell, moab::Core::type_from_handle(), moab::NestedRefine::refPatterns::vert_on_edges, and moab::NestedRefine::refPatterns::vert_on_faces.
Referenced by subdivide_cells(), and subdivide_tets().
{
// The vertices in the vbuffer are added to appropriate edges and faces of cells that are
// incident on the working cell.
ErrorCode error;
EntityHandle cstart_prev;
if( cur_level )
cstart_prev = level_mesh[cur_level - 1].start_cell;
else
cstart_prev = *_incells.begin();
EntityType cell_type = mbImpl->type_from_handle( cstart_prev );
int cindex = cell_type - 1;
int d = get_index_from_degree( deg );
int nve = refTemplates[cindex][d].nv_edge;
int nvf = refTemplates[cindex][d].nv_face;
int index = ahf->get_index_in_lmap( *( _incells.begin() ) );
int nepc = ahf->lConnMap3D[index].num_edges_in_cell;
int nfpc = ahf->lConnMap3D[index].num_faces_in_cell;
// Step 1: Add the vertices on an edge of the working cell to tracking array of incident cells.
for( int i = 0; i < nepc; i++ )
{
// Add the vertices to edges of the current cell
for( int j = 0; j < nve; j++ )
{
int id = refTemplates[cindex][d].vert_on_edges[i][j];
int idx = cid - cstart_prev;
int aid = idx * nve * nepc + nve * i + j;
if( !trackvertsC_edg[aid] ) trackvertsC_edg[aid] = vbuffer[id];
}
// Obtain all the incident cells
std::vector< EntityHandle > inc_cids;
std::vector< int > inc_leids, inc_orient;
error = ahf->get_up_adjacencies_edg_3d( cid, i, inc_cids, &inc_leids, &inc_orient );MB_CHK_ERR( error );
if( inc_cids.size() == 1 ) continue;
// Add the vertices to the edges of the incident cells
for( int k = 0; k < (int)inc_cids.size(); k++ )
{
if( inc_cids[k] == cid ) continue;
int idx = inc_cids[k] - cstart_prev;
if( inc_orient[k] ) // Same edge direction as the current edge
{
for( int j = 0; j < nve; j++ )
{
int id = refTemplates[cindex][d].vert_on_edges[i][j];
int aid = idx * nve * nepc + nve * inc_leids[k] + j;
if( !trackvertsC_edg[aid] ) trackvertsC_edg[aid] = vbuffer[id];
}
}
else
{
for( int j = 0; j < nve; j++ )
{
int id = refTemplates[cindex][d].vert_on_edges[i][nve - j - 1];
int aid = idx * nve * nepc + nve * inc_leids[k] + j;
if( !trackvertsC_edg[aid] ) trackvertsC_edg[aid] = vbuffer[id];
}
}
}
}
// Step 2: Add the vertices on a face of the working cell to tracking array of incident cells.
if( nvf )
{
for( int i = 0; i < nfpc; i++ )
{
// Add vertices to the tracking array of vertices on faces for the current cell
std::vector< EntityHandle > face_vbuf( nvf, 0 );
for( int j = 0; j < nvf; j++ )
{
int id = refTemplates[cindex][d].vert_on_faces[i][j];
int idx = cid - cstart_prev;
int aid = idx * nvf * nfpc + nvf * i + j;
if( !trackvertsC_face[aid] ) trackvertsC_face[aid] = vbuffer[id];
face_vbuf[j] = vbuffer[id];
}
// Obtain all the incident cells
std::vector< EntityHandle > sib_cids;
std::vector< int > sib_lfids;
error = ahf->get_up_adjacencies_face_3d( cid, i, sib_cids, &sib_lfids );MB_CHK_ERR( error );
if( sib_cids.size() == 1 ) continue;
// Reorder the vertex local ids incident on the half-face
std::vector< int > id_sib( nvf );
for( int k = 0; k < nvf; k++ )
id_sib[k] = 0;
error = reorder_indices( cur_level, deg, sib_cids[1], sib_lfids[1], cid, i, 0, &id_sib[0] );MB_CHK_ERR( error );
// Add vertices to the tracking array of vertices on faces for the sibling cell of the
// current cell
for( int j = 0; j < nvf; j++ )
{
int idx = sib_cids[1] - cstart_prev;
int aid = idx * nvf * nfpc + nvf * sib_lfids[1] + j;
if( !trackvertsC_face[aid] ) trackvertsC_face[aid] = face_vbuf[id_sib[j] - 1];
}
}
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::vertex_to_entities_down | ( | EntityHandle | vertex, |
| int | vert_level, | ||
| int | child_level, | ||
| std::vector< EntityHandle > & | incident_entities | ||
| ) |
Given a vertex from a certain level, it returns a std::vector of all children entities of incident entities to vertex from any subsequent levels
| vertex | EntityHandle of the vertex |
| vert_level | Mesh level of the vertex |
| child_level | Mesh level from which child entities are requested |
| incident_entities | Vector containing entities from the child level |
Definition at line 388 of file NestedRefine.cpp.
References ahf, moab::error(), ErrorCode, moab::HalfFacetRep::get_up_adjacencies_1d(), moab::HalfFacetRep::get_up_adjacencies_vert_2d(), moab::HalfFacetRep::get_up_adjacencies_vert_3d(), MB_CHK_ERR, MB_SUCCESS, meshdim, and parent_to_child().
Referenced by update_special_tags().
{
assert( vert_level < child_level );
ErrorCode error;
// Step 1: Get the incident entities at the current level
std::vector< EntityHandle > inents;
if( meshdim == 1 )
{
error = ahf->get_up_adjacencies_1d( vertex, inents );MB_CHK_ERR( error );
}
else if( meshdim == 2 )
{
error = ahf->get_up_adjacencies_vert_2d( vertex, inents );MB_CHK_ERR( error );
}
else if( meshdim == 3 )
{
error = ahf->get_up_adjacencies_vert_3d( vertex, inents );MB_CHK_ERR( error );
}
// Step 2: Loop over all the incident entities at the current level and gather their parents
std::vector< EntityHandle > childs;
for( int i = 0; i < (int)inents.size(); i++ )
{
childs.clear();
EntityHandle ent = inents[i];
error = parent_to_child( ent, vert_level, child_level, childs );MB_CHK_ERR( error );
for( int j = 0; j < (int)childs.size(); j++ )
incident_entities.push_back( childs[j] );
}
return MB_SUCCESS;
}
| ErrorCode moab::NestedRefine::vertex_to_entities_up | ( | EntityHandle | vertex, |
| int | vert_level, | ||
| int | parent_level, | ||
| std::vector< EntityHandle > & | incident_entities | ||
| ) |
Given a vertex from a certain level, it returns a std::vector of all entities from any previous levels that contains it.
| vertex | EntityHandle of the vertex |
| vert_level | Mesh level of the vertex |
| parent_level | Mesh level from which entities containing vertex is requested |
| incident_entities | Vector containing entities from the parent level incident on the vertex |
Definition at line 348 of file NestedRefine.cpp.
References ahf, child_to_parent(), moab::error(), ErrorCode, moab::HalfFacetRep::get_up_adjacencies_1d(), moab::HalfFacetRep::get_up_adjacencies_vert_2d(), moab::HalfFacetRep::get_up_adjacencies_vert_3d(), MB_CHK_ERR, MB_SUCCESS, and meshdim.
{
assert( vert_level > parent_level );
ErrorCode error;
// Step 1: Get the incident entities at the current level
std::vector< EntityHandle > inents;
if( meshdim == 1 )
{
error = ahf->get_up_adjacencies_1d( vertex, inents );MB_CHK_ERR( error );
}
else if( meshdim == 2 )
{
error = ahf->get_up_adjacencies_vert_2d( vertex, inents );MB_CHK_ERR( error );
}
else if( meshdim == 3 )
{
error = ahf->get_up_adjacencies_vert_3d( vertex, inents );MB_CHK_ERR( error );
}
// Step 2: Loop over all the incident entities at the current level and gather their parents
for( int i = 0; i < (int)inents.size(); i++ )
{
EntityHandle ent = inents[i];
EntityHandle parent;
error = child_to_parent( ent, vert_level, parent_level, &parent );MB_CHK_ERR( error );
incident_entities.push_back( parent );
}
// Step 3: Sort and remove duplicates
std::sort( incident_entities.begin(), incident_entities.end() );
incident_entities.erase( std::unique( incident_entities.begin(), incident_entities.end() ),
incident_entities.end() );
return MB_SUCCESS;
}
Range moab::NestedRefine::_incells [protected] |
Definition at line 175 of file NestedRefine.hpp.
Referenced by child_to_parent(), compute_coordinates(), construct_hm_1D(), construct_hm_2D(), construct_hm_3D(), count_subentities(), create_hm_storage_single_level(), estimate_hm_storage(), get_connectivity(), get_lid_inci_child(), initialize(), is_cell_on_boundary(), is_vertex_on_boundary(), parent_to_child(), reorder_indices(), subdivide_cells(), subdivide_tets(), update_global_ahf_3D(), update_local_ahf(), and update_tracking_verts().
Range moab::NestedRefine::_inedges [protected] |
Definition at line 175 of file NestedRefine.hpp.
Referenced by child_to_parent(), construct_hm_1D(), construct_hm_2D(), count_subentities(), estimate_hm_storage(), initialize(), parent_to_child(), update_global_ahf_1D(), and update_global_ahf_1D_sub().
Range moab::NestedRefine::_infaces [protected] |
Definition at line 175 of file NestedRefine.hpp.
Referenced by child_to_parent(), compute_coordinates(), construct_hm_1D(), construct_hm_2D(), count_subentities(), create_hm_storage_single_level(), estimate_hm_storage(), initialize(), parent_to_child(), subdivide_cells(), subdivide_tets(), update_global_ahf_2D(), and update_global_ahf_2D_sub().
Range moab::NestedRefine::_inverts [protected] |
Definition at line 175 of file NestedRefine.hpp.
Referenced by construct_hm_1D(), construct_hm_2D(), copy_vertices_from_prev_level(), estimate_hm_storage(), get_vertex_duplicates(), initialize(), subdivide_cells(), subdivide_tets(), update_global_ahf_1D(), update_global_ahf_1D_sub(), update_global_ahf_2D(), update_global_ahf_2D_sub(), and update_global_ahf_3D().
EntityHandle moab::NestedRefine::_rset [protected] |
Definition at line 173 of file NestedRefine.hpp.
Referenced by generate_hm(), generate_mesh_hierarchy(), initialize(), and update_special_tags().
HalfFacetRep* moab::NestedRefine::ahf [protected] |
Definition at line 171 of file NestedRefine.hpp.
Referenced by construct_hm_1D(), construct_hm_2D(), construct_hm_entities(), count_subentities(), create_hm_storage_single_level(), get_adjacencies(), get_connectivity(), get_lid_inci_child(), initialize(), is_cell_on_boundary(), is_edge_on_boundary(), is_face_on_boundary(), is_vertex_on_boundary(), reorder_indices(), subdivide_cells(), subdivide_tets(), update_ahf_1D(), update_global_ahf_1D(), update_global_ahf_1D_sub(), update_global_ahf_2D(), update_global_ahf_2D_sub(), update_global_ahf_3D(), update_local_ahf(), update_tracking_verts(), vertex_to_entities_down(), vertex_to_entities_up(), and ~NestedRefine().
std::map< int, int > moab::NestedRefine::deg_index [protected] |
Definition at line 180 of file NestedRefine.hpp.
Referenced by get_index_from_degree(), and initialize().
EntityType moab::NestedRefine::elementype [protected] |
Definition at line 177 of file NestedRefine.hpp.
Referenced by initialize(), is_cell_on_boundary(), is_edge_on_boundary(), is_face_on_boundary(), and is_vertex_on_boundary().
bool moab::NestedRefine::hasghost [protected] |
Definition at line 181 of file NestedRefine.hpp.
Referenced by exchange_ghosts(), and initialize().
const NestedRefine::intFEdge moab::NestedRefine::intFacEdg [static, protected] |
{
{ { 3, { { 3, 4 }, { 4, 5 }, { 5, 3 } } },
{ 9, { { 8, 3 }, { 3, 9 }, { 9, 4 }, { 4, 5 }, { 5, 9 }, { 9, 8 }, { 7, 9 }, { 9, 6 }, { 6, 7 } } } },
{ { 4, { { 4, 8 }, { 7, 8 }, { 8, 6 }, { 8, 5 } } },
{ 12,
{ { 4, 12 },
{ 12, 15 },
{ 15, 9 },
{ 5, 13 },
{ 13, 14 },
{ 14, 8 },
{ 11, 12 },
{ 12, 13 },
{ 13, 6 },
{ 10, 15 },
{ 15, 14 },
{ 14, 7 } } } } }
Definition at line 241 of file NestedRefine.hpp.
Referenced by construct_hm_2D(), and estimate_hm_storage().
int moab::NestedRefine::level_dsequence[MAX_LEVELS] [protected] |
Definition at line 179 of file NestedRefine.hpp.
Referenced by child_to_parent(), generate_mesh_hierarchy(), and parent_to_child().
level_memory moab::NestedRefine::level_mesh[MAX_LEVELS] [protected] |
Definition at line 255 of file NestedRefine.hpp.
Referenced by child_to_parent(), compute_coordinates(), construct_hm_1D(), construct_hm_2D(), copy_vertices_from_prev_level(), create_hm_storage_single_level(), estimate_hm_storage(), get_connectivity(), get_coordinates(), get_octahedron_corner_coords(), get_vertex_duplicates(), parent_to_child(), subdivide_cells(), subdivide_tets(), update_ahf_1D(), update_global_ahf_1D(), update_global_ahf_1D_sub(), update_global_ahf_2D(), update_global_ahf_2D_sub(), update_global_ahf_3D(), and update_tracking_verts().
Core* moab::NestedRefine::mbImpl [protected] |
Definition at line 169 of file NestedRefine.hpp.
Referenced by child_to_parent(), compute_coordinates(), construct_hm_2D(), construct_hm_3D(), copy_vertices_from_prev_level(), count_subentities(), create_hm_storage_single_level(), estimate_hm_storage(), exchange_ghosts(), generate_hm(), get_connectivity(), get_coordinates(), initialize(), is_entity_on_boundary(), NestedRefine(), parent_to_child(), update_global_ahf_2D(), update_global_ahf_2D_sub(), update_global_ahf_3D(), update_special_tags(), and update_tracking_verts().
int moab::NestedRefine::meshdim [protected] |
Definition at line 178 of file NestedRefine.hpp.
Referenced by estimate_hm_storage(), exchange_ghosts(), generate_mesh_hierarchy(), initialize(), is_cell_on_boundary(), is_edge_on_boundary(), is_face_on_boundary(), vertex_to_entities_down(), and vertex_to_entities_up().
int moab::NestedRefine::nlevels [protected] |
Definition at line 178 of file NestedRefine.hpp.
Referenced by generate_hm(), generate_mesh_hierarchy(), and update_special_tags().
ParallelComm* moab::NestedRefine::pcomm [protected] |
Definition at line 170 of file NestedRefine.hpp.
Referenced by exchange_ghosts(), generate_hm(), initialize(), and NestedRefine().
const NestedRefine::pmat moab::NestedRefine::permutation [static, protected] |
Definition at line 333 of file NestedRefine.hpp.
Referenced by reorder_indices().
const NestedRefine::refPatterns moab::NestedRefine::refTemplates [static, protected] |
Definition at line 231 of file NestedRefine.hpp.
Referenced by child_to_parent(), compute_coordinates(), construct_hm_1D(), construct_hm_2D(), estimate_hm_storage(), get_lid_inci_child(), parent_to_child(), subdivide_cells(), subdivide_tets(), update_global_ahf_1D(), update_global_ahf_1D_sub(), update_global_ahf_2D(), update_global_ahf_2D_sub(), update_global_ahf_3D(), update_local_ahf(), and update_tracking_verts().
Definition at line 166 of file NestedRefine.hpp.
Referenced by generate_hm(), and main().
CpuTimer* moab::NestedRefine::tm [protected] |
Definition at line 172 of file NestedRefine.hpp.
Referenced by generate_hm(), initialize(), and ~NestedRefine().
1.7.6.1.
Dark theme by Tilen Majerle. All rights reserved.