This example demonstrates geometric topology hierarchy traversal. It shows how to load a mesh file with geometric topology information, traverse the geometric hierarchy from regions down to vertices, access parent-child relationships between geometric entities, and determine geometric sense (forward/reverse) between entities. This tool is useful for understanding the geometric structure of CAD-based meshes and their hierarchical relationships.
#include "MBCN.hpp"
#include <iostream>
#include <cassert>
const char*
ent_names[] = {
"Vertex",
"Edge",
"Face",
"Region" };
int main(
int argc,
char** argv )
{
if( 1 == argc )
{
std::cout << "Usage: " << argv[0] << " <filename>" << std::endl;
return 0;
}
"Failed to get geometric dimension tag" );
gid_tag =
mb->globalId_tag();
assert( NULL != gid_tag );
std::vector< moab::EntityHandle > sense_ents;
std::vector< int > senses;
int dim, pgid, chgid;
void* dim_ptr = &dim;
int sense;
for( dim = 3; dim >= 0; dim-- )
{
"Failed to get entities by type and tag" );
for( ch_it = chsets.
begin(); ch_it != chsets.
end(); ++ch_it )
{
MB_CHK_SET_ERR(
mb->get_parent_meshsets( *ch_it, psets ),
"Failed to get parent meshsets" );
MB_CHK_SET_ERR(
mb->tag_get_data( gid_tag, &( *ch_it ), 1, &chgid ),
"Failed to get tag data" );
std::cout <<
ent_names[dim] <<
" " << chgid <<
" has " << psets.
size() <<
" parents." << std::endl;
if( 2 == dim )
{
for( p_it = psets.
begin(); p_it != psets.
end(); ++p_it )
{
MB_CHK_SET_ERR(
mb->tag_get_data( gid_tag, &( *p_it ), 1, &pgid ),
"Failed to get tag data" );
rval = gt.get_sense( *ch_it, *p_it, sense );
<< " sense is: ";
if( 1 == sense )
std::cout << "FORWARD" << std::endl;
else
std::cout << "REVERSE" << std::endl;
}
}
else if( 1 == dim )
{
sense_ents.clear();
senses.clear();
rval = gt.get_senses( *ch_it, sense_ents, senses );
for( unsigned int i = 0; i < sense_ents.size(); i++ )
{
MB_CHK_SET_ERR(
mb->tag_get_data( gid_tag, &sense_ents[i], 1, &pgid ),
"Failed to get tag data" );
<< " sense is: ";
if( -1 == senses[i] )
std::cout << "REVERSED" << std::endl;
else if( 0 == senses[i] )
std::cout << "BOTH" << std::endl;
else if( 1 == senses[i] )
std::cout << "FORWARD" << std::endl;
else
std::cout << "(invalid)" << std::endl;
}
}
}
}
return 0;
}