本文整理汇总了C++中MeshImpl::clear方法的典型用法代码示例。如果您正苦于以下问题：C++ MeshImpl::clear方法的具体用法？C++ MeshImpl::clear怎么用？C++ MeshImpl::clear使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类MeshImpl的用法示例。
在下文中一共展示了MeshImpl::clear方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: make_mesh
void SlaveBoundaryVerticesTest::make_mesh( MeshImpl& mesh,
DomainClassifier& domain,
const int intervals )
{
MsqPrintError err(std::cerr);
const char input_file[] = MESH_FILES_DIR "3D/VTK/6x6x6-hex20.vtk";
const Vector3D min( -3, -3, -3 );
const Vector3D max( 3, 3, 3 );
const Vector3D space = (max - min) * 1.0/(intervals);
mesh.clear();
mesh.read_vtk( input_file, err );
ASSERT_NO_ERROR(err);
const Vector3D corners[8] = { Vector3D(min[0],min[1],min[2]),
Vector3D(max[0],min[1],min[2]),
Vector3D(max[0],max[1],min[2]),
Vector3D(min[0],max[1],min[2]),
Vector3D(min[0],min[1],max[2]),
Vector3D(max[0],min[1],max[2]),
Vector3D(max[0],max[1],max[2]),
Vector3D(min[0],max[1],max[2]) };
MeshDomain* subdomains[26] = {
new PlanarDomain( PlanarDomain::XZ, min[1] ),
new PlanarDomain( PlanarDomain::YZ, max[0] ),
new PlanarDomain( PlanarDomain::XZ, max[1] ),
new PlanarDomain( PlanarDomain::YZ, min[0] ),
new PlanarDomain( PlanarDomain::XY, min[2] ),
new PlanarDomain( PlanarDomain::XY, max[2] ),
new LineDomain( corners[0], corners[1] - corners[0] ),
new LineDomain( corners[1], corners[2] - corners[1] ),
new LineDomain( corners[2], corners[3] - corners[2] ),
new LineDomain( corners[3], corners[0] - corners[3] ),
new LineDomain( corners[0], corners[4] - corners[0] ),
new LineDomain( corners[1], corners[5] - corners[1] ),
new LineDomain( corners[2], corners[6] - corners[0] ),
new LineDomain( corners[3], corners[7] - corners[1] ),
new LineDomain( corners[4], corners[5] - corners[4] ),
new LineDomain( corners[5], corners[6] - corners[5] ),
new LineDomain( corners[6], corners[7] - corners[6] ),
new LineDomain( corners[7], corners[4] - corners[7] ),
new PointDomain( corners[0] ),
new PointDomain( corners[1] ),
new PointDomain( corners[2] ),
new PointDomain( corners[3] ),
new PointDomain( corners[4] ),
new PointDomain( corners[5] ),
new PointDomain( corners[6] ),
new PointDomain( corners[7] ) };
const int subdims[26] = { 2, 2, 2, 2, 2, 2,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 0, 0, 0, 0, 0, 0, 0 };
DomainClassifier::classify_skin_geometrically( domain, &mesh, 1e-6,
subdomains, subdims, 26,
err );
domain.delete_sub_domains(true);
ASSERT_NO_ERROR(err);
}示例2: tearDown
void DomainClassifierTest::tearDown()
{
myMesh.clear();
while (!myDomains.empty()) {
delete myDomains.back().domain;
myDomains.pop_back();
}
domainDims.clear();
}示例3: setUp
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"
//.........这里部分代码省略.........