// Test reading Vtk vector attribute
void VtkTest::test_read_vector_attrib()
{
MeshImpl mesh;
MsqPrintError err(cout);
FILE* file = fopen( temp_file_name, "w+" );
fputs( structured_3d_points_data, file );
fputs( simple_vector_attrib, file );
fclose( file );
mesh.read_vtk( temp_file_name, err );
remove( temp_file_name );
ASSERT_NO_ERROR(err);
std::vector<Mesh::ElementHandle> elems;
mesh.get_all_elements( elems, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( elems.size(), (size_t)8 );
void* th = mesh.tag_get( "hexvect", err );
CPPUNIT_ASSERT( !err );
std::string name;
Mesh::TagType type;
unsigned tagsize;
mesh.tag_properties( th, name, type, tagsize, err );
CPPUNIT_ASSERT( !err && type == Mesh::DOUBLE && tagsize == 3 );
double elem_data[24];
mesh.tag_get_element_data( th, 8, arrptr(elems), elem_data, err );
CPPUNIT_ASSERT( !err );
for (int i = 0; i < 8; ++i)
CPPUNIT_ASSERT( Vector3D( elem_data+3*i ) == Vector3D( i+1, i+1, i+1 ) );
}
void VtkTest::check_field_attrib( const char* temp_file_name )
{
MeshImpl mesh;
MsqPrintError err(cout);
mesh.read_vtk( temp_file_name, err );
remove( temp_file_name );
ASSERT_NO_ERROR(err);
std::vector<Mesh::ElementHandle> elems;
mesh.get_all_elements( elems, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( elems.size(), (size_t)8 );
std::string name;
Mesh::TagType type;
unsigned tagsize;
void* th = mesh.tag_get( "test_field elem_vects", err );
CPPUNIT_ASSERT( !err );
mesh.tag_properties( th, name, type, tagsize, err );
CPPUNIT_ASSERT( !err && type == Mesh::DOUBLE && tagsize == 3 );
double elem_data[24];
mesh.tag_get_element_data( th, 8, arrptr(elems), elem_data, err );
CPPUNIT_ASSERT( !err );
for (int i = 0; i < 8; ++i)
CPPUNIT_ASSERT( Vector3D( elem_data+3*i ) == Vector3D( i+1, i+1, i+1 ) );
th = mesh.tag_get( "test_field elem_ids", err );
CPPUNIT_ASSERT( !err );
mesh.tag_properties( th, name, type, tagsize, err );
CPPUNIT_ASSERT( !err && type == Mesh::INT && tagsize == 1 );
int elem_ids[8];
mesh.tag_get_element_data( th, 8, arrptr(elems), elem_ids, err );
CPPUNIT_ASSERT( !err );
for (int i = 0; i < 8; ++i)
CPPUNIT_ASSERT( elem_ids[i] == i+1 );
th = mesh.tag_get( "field1", err );
CPPUNIT_ASSERT( !err );
mesh.tag_properties( th, name, type, tagsize, err );
CPPUNIT_ASSERT( !err && type == Mesh::INT && tagsize == 1 );
int values[8];
mesh.tag_get_element_data( th, 8, arrptr(elems), values, err );
CPPUNIT_ASSERT( !err );
for (int i = 0; i < 8; ++i)
CPPUNIT_ASSERT( values[i] == 8-i );
}
// Test reading Vtk simple (one-component) scalar attribute
void VtkTest::test_read_simple_scalar_attrib()
{
MeshImpl mesh;
MsqPrintError err(cout);
FILE* file = fopen( temp_file_name, "w+" );
fputs( structured_3d_points_data, file );
fputs( simple_scalar_attrib, file );
fclose( file );
mesh.read_vtk( temp_file_name, err );
remove( temp_file_name );
ASSERT_NO_ERROR(err);
std::vector<Mesh::ElementHandle> elems;
mesh.get_all_elements( elems, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( elems.size(), (size_t)8 );
void* th = mesh.tag_get( "global_id", err );
CPPUNIT_ASSERT( !err );
std::string name;
Mesh::TagType type;
unsigned tagsize;
mesh.tag_properties( th, name, type, tagsize, err );
CPPUNIT_ASSERT( !err && type == Mesh::INT && tagsize == 1 );
int elem_data[8];
mesh.tag_get_element_data( th, 8, arrptr(elems), elem_data, err );
CPPUNIT_ASSERT( !err );
for (int i = 0; i < 8; ++i)
CPPUNIT_ASSERT( elem_data[i] == (1+i) );
}
void DomainClassifierTest::check_domain( DomainClassifier& domain )
{
std::vector<Mesh::VertexHandle> vertices, cverts;
std::vector<Mesh::ElementHandle> elements, celems;
// Check that, for each entity with a domain, the
// DomainClassifier instance returns that domain.
// Also, put all entities with domains into cverts and
// celems for later.
for (unsigned i = 0; i < myDomains.size(); ++i) {
for (unsigned j = 0; j < myDomains[i].vertices.size(); ++j) {
Mesh::VertexHandle v = myDomains[i].vertices[j];
const MeshDomain* ptr = domain.find_vertex_domain( v );
CPPUNIT_ASSERT( myDomains[i].domain == ptr );
cverts.push_back( v );
}
for (unsigned k = 0; k < myDomains[i].elements.size(); ++k) {
Mesh::ElementHandle e = myDomains[i].elements[k];
const MeshDomain* ptr = domain.find_element_domain( e );
CPPUNIT_ASSERT( myDomains[i].domain == ptr );
celems.push_back( e );
}
}
// sort cverts and celems so we can do binary_search later
std::sort( cverts.begin(), cverts.end() );
std::sort( celems.begin(), celems.end() );
// get all vertices and elements in mesh
MsqPrintError err(std::cerr);
myMesh.get_all_vertices( vertices, err );
CPPUNIT_ASSERT(!err);
myMesh.get_all_elements( elements, err );
CPPUNIT_ASSERT(!err);
// For each vertex not in a domain (not in cverts), make sure
// that the domain is NULL.
for (size_t i = 0; i < vertices.size(); ++i) {
if (std::binary_search( cverts.begin(), cverts.end(), vertices[i] ))
continue;
const MeshDomain* ptr = domain.find_vertex_domain( vertices[i] );
CPPUNIT_ASSERT( NULL == ptr );
}
// For each element not in a domain (not in celems), make sure
// that the domain is NULL.
for (size_t i = 0; i < elements.size(); ++i) {
if (std::binary_search( celems.begin(), celems.end(), elements[i] ))
continue;
const MeshDomain* ptr = domain.find_element_domain( elements[i] );
CPPUNIT_ASSERT( NULL == ptr );
}
}
void get_planar_example( const char* filename,
DomainClassifier& geom,
MeshImpl& mesh,
MsqError& err )
{
static PlanarDomain z(PlanarDomain::XY);
mesh.read_vtk(filename, err); MSQ_ERRRTN(err);
mesh.mark_skin_fixed(err); MSQ_ERRRTN(err);
DomainClassifier::DomainSet set(&z);
mesh.get_all_vertices( set.vertices, err ); MSQ_ERRRTN(err);
mesh.get_all_elements( set.elements, err ); MSQ_ERRRTN(err);
DomainClassifier::classify_by_handle( geom, &mesh, &set, 1, err ); MSQ_ERRRTN(err);
}
// Test reading MeshImpl boundary-vertex bit
// from Vtk scalar attribute.
void VtkTest::test_read_fixed_attrib()
{
MeshImpl mesh;
MsqPrintError err(cout);
FILE* file = fopen( temp_file_name, "w+" );
fputs( structured_3d_points_data, file );
fputs( fixed_vertex_attrib, file );
fclose( file );
mesh.read_vtk( temp_file_name, err );
remove( temp_file_name );
ASSERT_NO_ERROR(err);
std::vector<Mesh::ElementHandle> elems;
mesh.get_all_elements( elems, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( elems.size(), (size_t)8 );
std::vector<Mesh::VertexHandle> verts;
std::vector<size_t> offsets;
mesh.elements_get_attached_vertices( arrptr(elems), elems.size(), verts, offsets, err );
ASSERT_NO_ERROR(err);
// get unique list of vertices
std::vector<Mesh::VertexHandle>::iterator new_end;
std::sort( verts.begin(), verts.end() );
new_end = std::unique( verts.begin(), verts.end() );
verts.resize( new_end - verts.begin() );
CPPUNIT_ASSERT_EQUAL( verts.size(), (size_t)27 );
// get fixed flag
std::vector<bool> fixed;
mesh.vertices_get_fixed_flag( arrptr(verts), fixed, verts.size(), err );
ASSERT_NO_ERROR(err);
CPPUNIT_ASSERT_EQUAL( verts.size(), fixed.size() );
for (int i = 0; i < 27; ++i)
{
bool should_be_fixed = (i != 13);
CPPUNIT_ASSERT_EQUAL( should_be_fixed, (bool)fixed[i] );
}
}
void VtkTest::test_read_unstructured( const char* filename )
{
MeshImpl mesh;
MsqPrintError err(cout);
mesh.read_vtk( filename, err );
ASSERT_NO_ERROR(err);
// Get mesh data
std::vector<Mesh::VertexHandle> conn;
std::vector<Mesh::ElementHandle> elems(38);
std::vector<size_t> offsets(39);
mesh.get_all_elements( elems, err );
ASSERT_NO_ERROR(err);
CPPUNIT_ASSERT_EQUAL( elems.size(), (size_t)38 );
mesh.elements_get_attached_vertices( arrptr(elems), elems.size(),
conn, offsets, err );
ASSERT_NO_ERROR(err);
unsigned i;
struct meshdata { EntityTopology type; size_t nodes; size_t count; };
meshdata list[] = {
{ Mesquite::HEXAHEDRON, 8, 8 },
{ Mesquite::QUADRILATERAL, 4, 4 },
{ Mesquite::PYRAMID, 5, 4 },
{ Mesquite::TETRAHEDRON, 4, 6 },
{ Mesquite::TRIANGLE, 3, 14 },
{ Mesquite::PRISM, 6, 2 },
{ Mesquite::MIXED, 0, 0 } };
// Count expected lenght of connectivity list
size_t conn_len = 0;
for (i = 0; list[i].nodes; ++i)
conn_len += list[i].nodes * list[i].count;
CPPUNIT_ASSERT_EQUAL( conn_len, conn.size() );
check_8hex_block( mesh, conn.begin() );
check_4quad_block( mesh, conn.begin() + 64 );
}
// Routine to create initial mesh for test.
// o Marks vertices at a greater topological depth than the specified
// value as slaved.
// o Perturbs higher-order vertices on skin towards element center
// o Marks skin vertices as fixed
int main( int argc, char* argv[] )
{
if (argc != 4)
usage(argv[0]);
char* endptr = 0;
const long n = strtol( argv[1], &endptr, 0 );
if (*endptr || n < 0)
usage(argv[0]);
// read input mesh
MeshImpl mesh;
MsqPrintError err(std::cerr);
mesh.read_vtk( argv[2], err );
if (err) return 1;
// get skin vertices
mesh.mark_skin_fixed( err, true );
if (err) return 1;
std::vector<Mesh::VertexHandle> verts;
mesh.get_all_vertices( verts, err );
if (err) return 1;
std::vector<bool> fixed;
mesh.vertices_get_fixed_flag( arrptr(verts), fixed, verts.size(), err );
if (err) return 1;
std::vector<Mesh::VertexHandle> skin;
for (size_t i = 0; i < verts.size(); ++i)
if (fixed[i])
skin.push_back( verts[i] );
// create map for vertex depth, and initialize to 0 for skin vertices
std::map<Mesh::VertexHandle,int> depth;
std::map<Mesh::VertexHandle,int>::iterator d_iter;
for (size_t i = 0; i < skin.size(); ++i)
depth[skin[i]] = 0;
// get all elements
std::vector<Mesh::ElementHandle> curr, next;
std::vector<Mesh::ElementHandle> conn;
std::vector<size_t> off;
mesh.get_all_elements( next, err );
// build sorted list of higher-order vertices
std::vector<Mesh::VertexHandle> higher_order;
for (size_t i = 0; i < next.size(); ++i) {
Mesh::ElementHandle elem = next[i];
conn.clear();
mesh.elements_get_attached_vertices( &elem, 1, conn, off, err );
if (err) return 1;
EntityTopology type;
mesh.elements_get_topologies( &elem, &type, 1, err );
std::copy( conn.begin() + TopologyInfo::corners(type), conn.end(),
std::back_inserter( higher_order ) );
}
std::sort( higher_order.begin(), higher_order.end() );
higher_order.erase( std::unique( higher_order.begin(), higher_order.end() ),
higher_order.end() );
// build depth map for all vertices
while (!next.empty()) {
curr.swap( next );
next.clear();
while (!curr.empty()) {
Mesh::ElementHandle elem = curr.back();
curr.pop_back();
conn.clear();
mesh.elements_get_attached_vertices( &elem, 1, conn, off, err );
if (err) return 1;
int min = std::numeric_limits<int>::max();
for (size_t i = 0; i < conn.size(); ++i) {
d_iter = depth.find( conn[i] );
if (d_iter != depth.end() && d_iter->second < min)
min = d_iter->second;
}
if (min == std::numeric_limits<int>::max()) {
next.push_back( elem );
continue;
}
for (size_t i = 0; i < conn.size(); ++i) {
d_iter = depth.find( conn[i] );
if (d_iter == depth.end() || d_iter->second > min+1)
depth[conn[i]] = min+1;
}
}
}
// write depth map to tag for debugging purposes
std::vector<int> depth_vals(verts.size());
for (size_t i = 0; i < verts.size(); ++i)
depth_vals[i] = depth[verts[i]];
TagHandle tag = mesh.tag_create( "depth", Mesh::INT, 1, 0, err );
if (err) return 1;
mesh.tag_set_vertex_data( tag, verts.size(), arrptr(verts), arrptr(depth_vals), err );
if (err) return 1;
// set tag specifying slaved vertices
for (size_t i = 0; i < verts.size(); ++i)
if (std::binary_search( higher_order.begin(), higher_order.end(), verts[i] ))
depth_vals[i] = depth[verts[i]] > n;
else
depth_vals[i] = 0;
tag = mesh.tag_create( "slaved", Mesh::INT, 1, 0, err );
if (err) return 1;
mesh.tag_set_vertex_data( tag, verts.size(), arrptr(verts), arrptr(depth_vals), err );
if (err) return 1;
// perturb mid-edge nodes along boundary
std::vector<MsqVertex> coords;
for (size_t i = 0; i < skin.size(); ++i) {
if (!std::binary_search( higher_order.begin(), higher_order.end(), skin[i]))
continue;
curr.clear();
mesh.vertices_get_attached_elements( &skin[i], 1, curr, off, err );
if (err) return 1;
assert(curr.size() == 1);
conn.clear();
mesh.elements_get_attached_vertices( arrptr(curr), 1, conn, off, err );
if (err) return 1;
// estimate element center
coords.resize( conn.size() );
mesh.vertices_get_coordinates( arrptr(conn), arrptr(coords), conn.size(), err );
if (err) return 1;
Vector3D mean(0.0);
for (size_t j = 0; j < coords.size(); ++j)
mean += coords[j];
mean /= coords.size();
size_t idx = std::find( conn.begin(), conn.end(), skin[i] ) - conn.begin();
assert(idx < conn.size());
Vector3D init = coords[idx];
Vector3D pos = (1 - PERTURB_FRACT) * init + PERTURB_FRACT * mean;
mesh.vertex_set_coordinates( skin[i], pos, err );
if (err) return 1;
}
mesh.write_vtk( argv[3], err );
if (err) return 1;
return 0;
}
void VtkTest::test_read_quadratic( const char* filename )
{
const size_t NUM_ELEM = 8;
MeshImpl mesh;
MsqPrintError err(cout);
mesh.read_vtk( filename, err );
ASSERT_NO_ERROR(err);
std::vector<Mesh::ElementHandle> elems(NUM_ELEM);
mesh.get_all_elements( elems, err );
ASSERT_NO_ERROR(err);
CPPUNIT_ASSERT_EQUAL(elems.size(), NUM_ELEM );
std::vector<Mesh::VertexHandle> conn;
std::vector<size_t> offsets;
mesh.elements_get_attached_vertices( arrptr(elems), elems.size(), conn, offsets, err );
ASSERT_NO_ERROR(err);
CPPUNIT_ASSERT_EQUAL( conn.size(), (size_t)108 );
EntityTopology types[NUM_ELEM];
mesh.elements_get_topologies( arrptr(elems), types, NUM_ELEM, err );
ASSERT_NO_ERROR(err);
static const double hex_corners[] =
{ 1.0, -1.0, -1.0,
1.0, 1.0, -1.0,
-1.0, 1.0, -1.0,
-1.0, -1.0, -1.0,
1.0, -1.0, 1.0,
1.0, 1.0, 1.0,
-1.0, 1.0, 1.0,
-1.0, -1.0, 1.0 };
static const double tet_corners[] =
{ 1.0, -1.0, -1.0,
1.0, 1.0, -1.0,
-1.0, 0.0, -1.0,
0.0, 0.0, 1.0 };
static const double pyr_corners[] =
{ 1.0, -1.0, -1.0,
1.0, 1.0, -1.0,
-1.0, 1.0, -1.0,
-1.0, -1.0, -1.0,
0.0, 0.0, 1.0 };
static const double pri_corners[] =
{ -1.0, -1.0, -1.0,
1.0, 1.0, -1.0,
-1.0, 1.0, -1.0,
-1.0, -1.0, 1.0,
1.0, 1.0, 1.0,
-1.0, 1.0, 1.0 };
static const unsigned hex_edges[] =
{ 0, 1,
1, 2,
2, 3,
3, 0,
0, 4,
1, 5,
2, 6,
3, 7,
4, 5,
5, 6,
6, 7,
7, 4 };
static const unsigned tet_edges[] =
{ 0, 1,
1, 2,
2, 0,
0, 3,
1, 3,
2, 3 };
static const unsigned pri_edges[] =
{ 0, 1,
1, 2,
2, 0,
0, 3,
1, 4,
2, 5,
3, 4,
4, 5,
5, 3 };
static const unsigned pyr_edges[] =
{ 0, 1,
1, 2,
2, 3,
3, 0,
0, 4,
1, 4,
2, 4,
3, 4 };
static const unsigned hex_faces[] =
{ 4, 0, 1, 5, 4,
4, 1, 2, 6, 5,
4, 2, 3, 7, 6,
4, 3, 0, 4, 7,
4, 3, 2, 1, 0,
4, 4, 5, 6, 7
};
static const struct {
EntityTopology topology;
unsigned num_corners;
unsigned num_edges;
unsigned num_faces; // if non-zero expect mid-face nodes
unsigned num_region; // if non-zero expect mid-region node
const double* corners;
const unsigned* edges;
const unsigned* faces;
} expected_elems[NUM_ELEM] = {
{ Mesquite::HEXAHEDRON, 8, 12, 0, 0, hex_corners, hex_edges, hex_faces },
{ Mesquite::HEXAHEDRON, 8, 12, 6, 1, hex_corners, hex_edges, hex_faces },
{ Mesquite::TETRAHEDRON, 4, 6, 0, 0, tet_corners, tet_edges, 0 },
{ Mesquite::QUADRILATERAL, 4, 4, 0, 0, hex_corners, hex_edges, 0 },
{ Mesquite::QUADRILATERAL, 4, 4, 0, 1, hex_corners, hex_edges, 0 },
{ Mesquite::TRIANGLE, 3, 3, 0, 0, tet_corners, tet_edges, 0 },
{ Mesquite::PRISM, 6, 9, 0, 0, pri_corners, pri_edges, 0 },
{ Mesquite::PYRAMID, 5, 8, 0, 0, pyr_corners, pyr_edges, 0 } };
MsqVertex have;
std::vector<Mesh::VertexHandle>::iterator v_it = conn.begin();
for (unsigned i = 0; i < NUM_ELEM; ++i)
{
CPPUNIT_ASSERT_EQUAL( expected_elems[i].topology, types[i] );
size_t vtx_start = offsets[i];
size_t vtx_end = offsets[i+1];
size_t conn_len = expected_elems[i].num_corners
+ expected_elems[i].num_edges
+ expected_elems[i].num_faces
+ expected_elems[i].num_region;
CPPUNIT_ASSERT_EQUAL( conn_len, vtx_end - vtx_start );
for (unsigned c = 0; c < expected_elems[i].num_corners; ++c, ++v_it)
{
Vector3D expected(expected_elems[i].corners + 3*c);
mesh.vertices_get_coordinates( &*v_it, &have, 1, err );
ASSERT_NO_ERROR(err);
expected -= have;
CPPUNIT_ASSERT_DOUBLES_EQUAL( 0.0, expected.length(), DBL_EPSILON );
}
for (unsigned m = 0; m < expected_elems[i].num_edges; ++m, ++v_it)
{
unsigned start_idx = expected_elems[i].edges[2*m];
unsigned end_idx = expected_elems[i].edges[2*m+1];
Vector3D start( expected_elems[i].corners + 3*start_idx );
Vector3D end( expected_elems[i].corners + 3*end_idx );
Vector3D expected = 0.5 * (start + end);
mesh.vertices_get_coordinates( &*v_it, &have, 1, err );
ASSERT_NO_ERROR(err);
expected -= have;
CPPUNIT_ASSERT_DOUBLES_EQUAL( 0.0, expected.length(), DBL_EPSILON );
}
const unsigned* f_it = expected_elems[i].faces;
for (unsigned m = 0; m < expected_elems[i].num_faces; ++m, ++v_it)
{
Vector3D expected(0,0,0);
const unsigned face_size = *f_it; ++f_it;
CPPUNIT_ASSERT( face_size == 3u || face_size == 4u );
for (unsigned f = 0; f < face_size; ++f, ++f_it)
expected += Vector3D( expected_elems[i].corners + 3 * *f_it );
expected /= face_size;
mesh.vertices_get_coordinates( &*v_it, &have, 1, err );
ASSERT_NO_ERROR(err);
expected -= have;
CPPUNIT_ASSERT_DOUBLES_EQUAL( 0.0, expected.length(), DBL_EPSILON );
}
if (expected_elems[i].num_region) {
CPPUNIT_ASSERT_EQUAL( 1u, expected_elems[i].num_region );
Vector3D expected(0,0,0);
for (unsigned m = 0; m < expected_elems[i].num_corners; ++m)
expected += Vector3D( expected_elems[i].corners + 3*m );
expected /= expected_elems[i].num_corners;
mesh.vertices_get_coordinates( &*v_it, &have, 1, err );
ASSERT_NO_ERROR(err);
expected -= have;
CPPUNIT_ASSERT_DOUBLES_EQUAL( 0.0, expected.length(), DBL_EPSILON );
++v_it;
}
}
}
void DomainClassifierTest::setUp()
{
myMesh.clear();
myDomains.clear();
domainDims.clear();
// vertex coodinates
const char vertex_data[] =
"POINTS 64 float\n"
"0 0 0 1 0 0 2 0 0 3 0 0\n"
"0 1 0 1 1 0 2 1 0 3 1 0\n"
"0 2 0 1 2 0 2 2 0 3 2 0\n"
"0 3 0 1 3 0 2 3 0 3 3 0\n"
"\n"
"0 0 1 1 0 1 2 0 1 3 0 1\n"
"0 1 1 1 1 1 2 1 1 3 1 1\n"
"0 2 1 1 2 1 2 2 1 3 2 1\n"
"0 3 1 1 3 1 2 3 1 3 3 1\n"
"\n"
"0 0 2 1 0 2 2 0 2 3 0 2\n"
"0 1 2 1 1 2 2 1 2 3 1 2\n"
"0 2 2 1 2 2 2 2 2 3 2 2\n"
"0 3 2 1 3 2 2 3 2 3 3 2\n"
"\n"
"0 0 3 1 0 3 2 0 3 3 0 3\n"
"0 1 3 1 1 3 2 1 3 3 1 3\n"
"0 2 3 1 2 3 2 2 3 3 2 3\n"
"0 3 3 1 3 3 2 3 3 3 3 3\n"
"\n";
// quad connectivity for quads on mesh skin
const int num_quads = 9*6; // nine per side
const char quad_data[] =
"4 1 0 4 5\n" // -z face (z == 0)
"4 2 1 5 6\n"
"4 3 2 6 7\n"
"4 5 4 8 9\n"
"4 6 5 9 10\n"
"4 7 6 10 11\n"
"4 9 8 12 13\n"
"4 10 9 13 14\n"
"4 11 10 14 15\n"
"\n"
"4 48 49 53 52\n" // +z face (z == 3)
"4 49 50 54 53\n"
"4 50 51 55 54\n"
"4 52 53 57 56\n"
"4 53 54 58 57\n"
"4 54 55 59 58\n"
"4 56 57 61 60\n"
"4 57 58 62 61\n"
"4 58 59 63 62\n"
"\n"
"4 0 1 17 16\n" // -y face (y == 0)
"4 1 2 18 17\n"
"4 2 3 19 18\n"
"4 16 17 33 32\n"
"4 17 18 34 33\n"
"4 18 19 35 34\n"
"4 32 33 49 48\n"
"4 33 34 50 49\n"
"4 34 35 51 50\n"
"\n"
"4 13 12 28 29\n" // +y face (y == 3)
"4 14 13 29 30\n"
"4 15 14 30 31\n"
"4 29 28 44 45\n"
"4 30 29 45 46\n"
"4 31 30 46 47\n"
"4 45 44 60 61\n"
"4 46 45 61 62\n"
"4 47 46 62 63\n"
"\n"
"4 4 0 16 20\n" // -x face (x == 0)
"4 8 4 20 24\n"
"4 12 8 24 28\n"
"4 20 16 32 36\n"
"4 24 20 36 40\n"
"4 28 24 40 44\n"
"4 36 32 48 52\n"
"4 40 36 52 56\n"
"4 44 40 56 60\n"
"\n"
"4 3 7 23 19\n" // +x face (x == 3)
"4 7 11 27 23\n"
"4 11 15 31 27\n"
"4 19 23 39 35\n"
"4 23 27 43 39\n"
"4 27 31 47 43\n"
"4 35 39 55 51\n"
"4 39 43 59 55\n"
"4 43 47 63 59\n"
"\n";
// hexahedron connectivity
const int num_hexes = 3*3*3;
const char hex_data[] =
"8 0 1 5 4 16 17 21 20\n"
"8 1 2 6 5 17 18 22 21\n"
"8 2 3 7 6 18 19 23 22\n"
"8 4 5 9 8 20 21 25 24\n"
"8 5 6 10 9 21 22 26 25\n"
"8 6 7 11 10 22 23 27 26\n"
"8 8 9 13 12 24 25 29 28\n"
"8 9 10 14 13 25 26 30 29\n"
"8 10 11 15 14 26 27 31 30\n"
"\n"
"8 16 17 21 20 32 33 37 36\n"
"8 17 18 22 21 33 34 38 37\n"
"8 18 19 23 22 34 35 39 38\n"
"8 20 21 25 24 36 37 41 40\n"
"8 21 22 26 25 37 38 42 41\n"
"8 22 23 27 26 38 39 43 42\n"
"8 24 25 29 28 40 41 45 44\n"
"8 25 26 30 29 41 42 46 45\n"
"8 26 27 31 30 42 43 47 46\n"
"\n"
"8 32 33 37 36 48 49 53 52\n"
"8 33 34 38 37 49 50 54 53\n"
"8 34 35 39 38 50 51 55 54\n"
"8 36 37 41 40 52 53 57 56\n"
"8 37 38 42 41 53 54 58 57\n"
"8 38 39 43 42 54 55 59 58\n"
"8 40 41 45 44 56 57 61 60\n"
"8 41 42 46 45 57 58 62 61\n"
"8 42 43 47 46 58 59 63 62\n"
"\n";
// a few interior quads
const int num_interior_quads = 3;
const char interior_quad_data[] =
"4 1 5 25 17\n"
"4 4 5 25 24\n"
"4 16 17 25 24\n"
"\n";
const char filename[] = "dctest.vtk";
FILE* file = fopen( filename, "w" );
fputs( "# vtk DataFile Version 2.0\n", file );
fputs( "Mesquite Mesh\n", file );
fputs( "ASCII\n", file );
fputs( "DATASET UNSTRUCTURED_GRID\n", file );
fputs( vertex_data, file );
int num_elem = num_quads + num_hexes + num_interior_quads;
int num_elem_data = 5*num_quads + 9*num_hexes * 5*num_interior_quads;
fprintf( file, "CELLS %d %d\n", num_elem, num_elem_data );
fputs( quad_data, file );
fputs( hex_data, file );
fputs( interior_quad_data, file );
fprintf( file, "CELL_TYPES %d\n", num_elem );
for (int i = 0; i < num_quads; ++i)
fputs( "9\n", file );
for (int i = 0; i < num_hexes; ++i)
fputs( "12\n", file );
for (int i = 0; i < num_interior_quads; ++i)
fputs( "9\n", file );
fclose( file );
MsqPrintError err(std::cerr);
myMesh.read_vtk( filename, err );
remove( filename );
CPPUNIT_ASSERT(!err);
std::vector<Mesh::VertexHandle> verts;
std::vector<Mesh::ElementHandle> elems;
myMesh.get_all_vertices(verts, err);
CPPUNIT_ASSERT(!err);
CPPUNIT_ASSERT_EQUAL( (size_t)64, verts.size() );
myMesh.get_all_elements(elems, err);
CPPUNIT_ASSERT(!err);
CPPUNIT_ASSERT_EQUAL( (size_t)num_elem, elems.size() );
// define point domains
PointDomain* pdom[8];
pdom[0] = new PointDomain( Vector3D(0,0,0) );
pdom[1] = new PointDomain( Vector3D(3,0,0) );
pdom[2] = new PointDomain( Vector3D(0,3,0) );
pdom[3] = new PointDomain( Vector3D(3,3,0) );
pdom[4] = new PointDomain( Vector3D(0,0,3) );
pdom[5] = new PointDomain( Vector3D(3,0,3) );
pdom[6] = new PointDomain( Vector3D(0,3,3) );
pdom[7] = new PointDomain( Vector3D(3,3,3) );
size_t pdidx[8] = { 0, 3, 12, 15, 48, 51, 60, 63 };
for (unsigned i = 0; i < 8; ++i) {
MsqVertex coords;
Mesh::VertexHandle h = verts[pdidx[i]];
myMesh.vertices_get_coordinates( &h, &coords, 1, err );
CPPUNIT_ASSERT(!err);
CPPUNIT_ASSERT_VECTORS_EQUAL( pdom[i]->geom(), coords, 1e-6 );
DomSet set;
set.domain = pdom[i];
set.vertices.push_back( h );
myDomains.push_back( set );
domainDims.push_back( 0 );
}
// define line domains
LineDomain* ldom[12];
ldom[0] = new LineDomain( Vector3D(0,0,0), Vector3D(1,0,0) ); // y=0,z=0
ldom[1] = new LineDomain( Vector3D(0,3,0), Vector3D(1,0,0) ); // y=3,z=0
ldom[2] = new LineDomain( Vector3D(0,0,3), Vector3D(1,0,0) ); // y=0,z=3
ldom[3] = new LineDomain( Vector3D(0,3,3), Vector3D(1,0,0) ); // y=3,z=3
ldom[4] = new LineDomain( Vector3D(0,0,0), Vector3D(0,1,0) ); // x=0,z=0
ldom[5] = new LineDomain( Vector3D(3,0,0), Vector3D(0,1,0) ); // x=3,z=0
ldom[6] = new LineDomain( Vector3D(0,0,3), Vector3D(0,1,0) ); // x=0,z=3
ldom[7] = new LineDomain( Vector3D(3,0,3), Vector3D(0,1,0) ); // x=3,z=3
ldom[8] = new LineDomain( Vector3D(0,0,0), Vector3D(0,0,1) ); // x=0,y=0
ldom[9] = new LineDomain( Vector3D(3,0,0), Vector3D(0,0,1) ); // x=3,y=0
ldom[10]= new LineDomain( Vector3D(0,3,0), Vector3D(0,0,1) ); // x=0,y=3
ldom[11]= new LineDomain( Vector3D(3,3,0), Vector3D(0,0,1) ); // x=3,y=3
size_t ldidx[12][2] = { { 1, 2 }, { 13, 14 }, { 49, 50 }, { 61, 62 },
{ 4, 8 }, { 7, 11 }, { 52, 56 }, { 55, 59 },
{ 16, 32 }, { 19, 35 }, { 28, 44 }, { 31, 47 } };
for (unsigned i = 0; i < 12; ++i) {
Mesh::VertexHandle v[2];
v[0] = verts[ldidx[i][0]];
v[1] = verts[ldidx[i][1]];
MsqVertex coords[2];
myMesh.vertices_get_coordinates( v, coords, 2, err );
CPPUNIT_ASSERT(!err);
CPPUNIT_ASSERT_DOUBLES_EQUAL( 0.0, ldom[i]->geom().distance( coords[0] ), 1e-6 );
CPPUNIT_ASSERT_DOUBLES_EQUAL( 0.0, ldom[i]->geom().distance( coords[1] ), 1e-6 );
DomSet set;
set.domain = ldom[i];
set.vertices.push_back(v[0]);
set.vertices.push_back(v[1]);
myDomains.push_back( set );
domainDims.push_back( 1 );
}
// define planar domains
PlanarDomain* sdom[6];
sdom[0] = new PlanarDomain( Vector3D( 0, 0,-1), Vector3D(0,0,0) );
sdom[1] = new PlanarDomain( Vector3D( 0, 0, 1), Vector3D(0,0,3) );
sdom[2] = new PlanarDomain( Vector3D( 0,-1, 0), Vector3D(0,0,0) );
sdom[3] = new PlanarDomain( Vector3D( 0, 1, 0), Vector3D(0,3,0) );
sdom[4] = new PlanarDomain( Vector3D(-1, 0, 0), Vector3D(0,0,0) );
sdom[5] = new PlanarDomain( Vector3D( 1, 0, 0), Vector3D(3,0,0) );
size_t sdidx[6][4] = { { 5, 6, 9, 10 }, { 53, 54, 57, 58 },
{ 17, 18, 33, 34 }, { 29, 30, 45, 46 },
{ 20, 24, 36, 40 }, { 23, 27, 39, 43 } };
for (unsigned i = 0; i < 6; ++i) {
DomSet set;
set.domain = sdom[i];
for (unsigned j = 0; j < 4; ++j)
set.vertices.push_back( verts[sdidx[i][j]] );
for (unsigned j = 0; j < 9; ++j)
set.elements.push_back( elems[9*i+j] );
myDomains.push_back( set );
domainDims.push_back( 2 );
}
// for (unsigned i = 0; i < myDomains.size(); ++i)
// print_domain( i, myDomains[i] );
}
void SlaveBoundaryVerticesTest::test_slaved_common( unsigned depth, unsigned boundary )
{
MeshImpl mesh;
DomainClassifier domain;
make_mesh( mesh, domain, 2*depth+2 );
MsqPrintError err(std::cerr);
std::vector< std::vector<Mesh::VertexHandle> > depths(depth+1);
std::set<Mesh::VertexHandle> non_slave;
std::set<Mesh::VertexHandle>::iterator p;
// find boundary vertices
std::vector<Mesh::VertexHandle> verts;
mesh.get_all_vertices( verts, err ); ASSERT_NO_ERROR(err);
CPPUNIT_ASSERT(!verts.empty());
if (boundary >= 4) {
std::vector<bool> flags;
mesh.vertices_get_fixed_flag( arrptr(verts), flags, verts.size(), err );
ASSERT_NO_ERROR(err);
for (size_t i = 0; i < verts.size(); ++i)
if (flags[i]) {
depths[0].push_back( verts[i] );
non_slave.insert( verts[i] );
}
}
else {
std::vector<unsigned short> dim(verts.size());
domain.domain_DoF( arrptr(verts), arrptr(dim), verts.size(), err );
ASSERT_NO_ERROR(err);
for (size_t i = 0; i < verts.size(); ++i)
if (dim[i] <= boundary) {
depths[0].push_back( verts[i] );
non_slave.insert( verts[i] );
}
}
// check that our input is usable for this test
CPPUNIT_ASSERT( !verts.empty() );
// find all vertices up to specified depth
for (unsigned d = 0; d < depth; ++d) {
for (size_t i = 0; i < depths[d].size(); ++i) {
std::vector<Mesh::ElementHandle> adj;
std::vector<size_t> junk;
mesh.vertices_get_attached_elements( &depths[d][i], 1, adj, junk, err );
ASSERT_NO_ERROR(err);
for(size_t j = 0; j < adj.size(); ++j) {
junk.clear();
std::vector<Mesh::VertexHandle> conn;
mesh.elements_get_attached_vertices( &adj[j], 1, conn, junk, err );
ASSERT_NO_ERROR(err);
for (size_t k = 0; k < conn.size(); ++k) {
p = non_slave.find(conn[k]);
if (p == non_slave.end()) {
non_slave.insert( p, conn[k] );
depths[d+1].push_back( conn[k] );
}
}
}
}
}
// Check that our input is usable for this test:
// Should have some vertices that are not within the specified depth of
// the boundary.
CPPUNIT_ASSERT( non_slave.size() < verts.size() );
// Now build a map of all higher-order nodes in the mesh
std::set<Mesh::VertexHandle> higher_order;
std::vector<Mesh::ElementHandle> elems;
mesh.get_all_elements( elems, err );
ASSERT_NO_ERROR(err);
CPPUNIT_ASSERT(!elems.empty());
std::vector<EntityTopology> types(elems.size());
mesh.elements_get_topologies( arrptr(elems), arrptr(types), elems.size(), err );
ASSERT_NO_ERROR(err);
for (size_t i = 0; i < elems.size(); ++i) {
std::vector<Mesh::VertexHandle> conn;
std::vector<size_t> junk;
mesh.elements_get_attached_vertices( &elems[i], 1, conn, junk, err );
ASSERT_NO_ERROR(err);
for (size_t j = TopologyInfo::corners( types[i] ); j < conn.size(); ++j)
higher_order.insert( conn[j] );
}
// Check that our input is usable for this test:
// Should have some higher-order vertices
CPPUNIT_ASSERT( !higher_order.empty() );
// Now build a map of all fixed vertices
std::set<Mesh::VertexHandle> fixed_vertices;
std::vector<bool> fixed;
mesh.vertices_get_fixed_flag( arrptr(verts), fixed, verts.size(), err );
ASSERT_NO_ERROR(err);
for (size_t i = 0; i < verts.size(); ++i)
if (fixed[i])
fixed_vertices.insert( verts[i] );
// Now actually run the tool
Settings settings;
settings.set_slaved_ho_node_mode( Settings::SLAVE_CALCULATED );
SlaveBoundaryVertices tool( depth, boundary );
tool.loop_over_mesh( &mesh, &domain, &settings, err );
ASSERT_NO_ERROR(err);
// Now verify the results
std::vector<unsigned char> bytes( verts.size() );
mesh.vertices_get_byte( arrptr(verts), arrptr(bytes), verts.size(), err );
ASSERT_NO_ERROR(err);
for (size_t i = 0; i < verts.size(); ++i) {
bool in_non_slave = (non_slave.find( verts[i] ) != non_slave.end());
bool in_fixed = (fixed_vertices.find( verts[i] ) != fixed_vertices.end());
bool in_higher_order = (higher_order.find( verts[i] ) != higher_order.end());
if (bytes[i] & MsqVertex::MSQ_DEPENDENT) { // if slave node
// must not be within 'depth' of boundary
CPPUNIT_ASSERT( !in_non_slave );
// must be a higher-order vertex
CPPUNIT_ASSERT( in_higher_order );
// must not be fixed
CPPUNIT_ASSERT( !in_fixed );
}
else {
// there are three reasons that a vertex isn't slaved
bool in_non_slave = (non_slave.find( verts[i] ) != non_slave.end());
bool in_fixed = (fixed_vertices.find( verts[i] ) != fixed_vertices.end());
bool in_higher_order = (higher_order.find( verts[i] ) != higher_order.end());
CPPUNIT_ASSERT( in_fixed || !in_higher_order || in_non_slave );
}
}
}