📄 itkautomatictopologyquadedgemeshsourcetest.cxx
字号:
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkAutomaticTopologyQuadEdgeMeshSourceTest.cxx,v $
Language: C++
Date: $Date: 2008-07-12 00:10:14 $
Version: $Revision: 1.4 $
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include <math.h>
#include <time.h>
#include <iostream>
#include <set>
#include "itkQuadEdgeMesh.h"
#include "itkAutomaticTopologyMeshSource.h"
int
itkAutomaticTopologyQuadEdgeMeshSourceTest(int, char* [] )
{
// Declare the type of the Mesh
typedef itk::QuadEdgeMesh< double, 3 > MeshType;
typedef MeshType::PointType PointType;
typedef MeshType::CellType CellType;
typedef itk::AutomaticTopologyMeshSource< MeshType > MeshSourceType;
typedef MeshSourceType::IdentifierType IdentifierType;
typedef MeshSourceType::IdentifierArrayType IdentifierArrayType;
MeshSourceType::Pointer meshSource;
meshSource = MeshSourceType::New();
// Begin using various AddPoint functions to add the vertices of a
// cube.
// Point expressed as an itk::Point.
PointType p;
p[ 0 ] = 0;
p[ 1 ] = 0;
p[ 2 ] = 0;
meshSource->AddPoint( p );
// Point expressed as a C array.
float a[3];
a[ 0 ] = 1;
a[ 1 ] = 0;
a[ 2 ] = 0;
meshSource->AddPoint( a );
// Points expressed using their coordinates.
meshSource->AddPoint( 0, 1, 0 );
meshSource->AddPoint( 1, 1, 0 );
meshSource->AddPoint( 0, 0, 1 );
meshSource->AddPoint( 1, 0, 1 );
meshSource->AddPoint( 0, 1, 1 );
meshSource->AddPoint( 1, 1, 1 );
// Done adding vertices of a cube.
// Add a cell of each type using an Array of point IDs. Here we use
// the fact that the IDs are assigned in order, and the fact that
// the Add[Cell] methods only use the first N entries of the array.
IdentifierArrayType idArray( 8 );
{
for( unsigned int i = 0; i < 8; i++ )
{
idArray[ i ] = i;
}
}
meshSource->AddVertex( idArray );
meshSource->AddLine( idArray );
meshSource->AddTriangle( idArray );
meshSource->AddQuadrilateral( idArray );
meshSource->AddTetrahedron( idArray ); // Degenerate; that's OK.
meshSource->AddHexahedron( idArray );
// Now add a new cube of points. It overlaps along one face.
IdentifierArrayType idArray1( 8 );
idArray1[ 0 ] = meshSource->AddPoint( 1, 0, 0 );
idArray1[ 1 ] = meshSource->AddPoint( 2, 0, 0 );
idArray1[ 2 ] = meshSource->AddPoint( 1, 1, 0 );
idArray1[ 3 ] = meshSource->AddPoint( 2, 1, 0 );
idArray1[ 4 ] = meshSource->AddPoint( 1, 0, 1 );
idArray1[ 5 ] = meshSource->AddPoint( 2, 0, 1 );
idArray1[ 6 ] = meshSource->AddPoint( 1, 1, 1 );
idArray1[ 7 ] = meshSource->AddPoint( 2, 1, 1 );
// Add cells using parameter lists of IDs.
meshSource->AddVertex( idArray[7] );
// PROBLEM LINE
meshSource->AddLine( idArray[6], idArray[7] );
meshSource->AddTriangle( idArray[5], idArray[6], idArray[7] );
meshSource->AddQuadrilateral( idArray[4], idArray[5],
idArray[6], idArray[7] );
meshSource->AddTetrahedron( idArray[0], idArray[2],
idArray[4], idArray[6] );
meshSource->AddHexahedron( idArray[0], idArray[1],
idArray[2], idArray[3],
idArray[4], idArray[5],
idArray[6], idArray[7] );
// Add cells using new point identifiers.
meshSource->AddVertex( meshSource->AddPoint( 3, 1, 1 ) );
// PROBLEM LINES
meshSource->AddLine(
meshSource->AddPoint( 2, 1, 1 ),
meshSource->AddPoint( 3, 1, 1 )
);
meshSource->AddTriangle(
meshSource->AddPoint( 3, 0, 1 ),
meshSource->AddPoint( 2, 1, 1 ),
meshSource->AddPoint( 3, 1, 1 )
);
meshSource->AddQuadrilateral(
meshSource->AddPoint( 2, 0, 1 ),
meshSource->AddPoint( 3, 0, 1 ),
meshSource->AddPoint( 2, 1, 1 ),
meshSource->AddPoint( 3, 1, 1 )
);
meshSource->AddTetrahedron(
meshSource->AddPoint( 2, 0, 1 ),
meshSource->AddPoint( 3, 0, 1 ),
meshSource->AddPoint( 2, 1, 1 ),
meshSource->AddPoint( 3, 1, 1 )
);
meshSource->AddHexahedron(
meshSource->AddPoint( 2, 0, 0 ),
meshSource->AddPoint( 3, 0, 0 ),
meshSource->AddPoint( 2, 1, 0 ),
meshSource->AddPoint( 3, 1, 0 ),
meshSource->AddPoint( 2, 0, 1 ),
meshSource->AddPoint( 3, 0, 1 ),
meshSource->AddPoint( 2, 1, 1 ),
meshSource->AddPoint( 3, 1, 1 )
);
// Add cells using C arrays of point coordinates.
MeshSourceType::CoordinateType points[8][3] =
{
{3, 0, 0},
{4, 0, 0},
{3, 1, 0},
{4, 1, 0},
{3, 0, 1},
{4, 0, 1},
{3, 1, 1},
{4, 1, 1}
};
meshSource->AddVertex( points[7] );
meshSource->AddLine( points[6], points[7] );
meshSource->AddTriangle( points[5], points[6], points[7] );
meshSource->AddQuadrilateral( points[4], points[5], points[6], points[7] );
meshSource->AddTetrahedron( points[3], points[5], points[6], points[7] );
meshSource->AddHexahedron( points[0], points[1], points[2], points[3],
points[4], points[5], points[6], points[7] );
// Print out the resulting mesh data.
std::cout << MeshType::Pointer(meshSource->GetOutput()) << std::endl;
// Now do a sanity check. Create a mesh consisting of a pair of
// tetrahedra sharing a face and a pair of cubes sharing a face, and
// then check properties.
meshSource = MeshSourceType::New();
meshSource->AddTetrahedron(
meshSource->AddPoint( 0, 0, 0 ),
meshSource->AddPoint( 1, 0, 0 ),
meshSource->AddPoint( 0, 1, 0 ),
meshSource->AddPoint( 0, 0, 1 )
);
meshSource->AddTetrahedron(
meshSource->AddPoint( 1, 1, 1 ),
meshSource->AddPoint( 1, 0, 0 ),
meshSource->AddPoint( 0, 1, 0 ),
meshSource->AddPoint( 0, 0, 1 )
);
meshSource->AddHexahedron(
meshSource->AddPoint( 2, 0, 0 ),
meshSource->AddPoint( 3, 0, 0 ),
meshSource->AddPoint( 2, 1, 0 ),
meshSource->AddPoint( 3, 1, 0 ),
meshSource->AddPoint( 2, 0, 1 ),
meshSource->AddPoint( 3, 0, 1 ),
meshSource->AddPoint( 2, 1, 1 ),
meshSource->AddPoint( 3, 1, 1 )
);
meshSource->AddHexahedron(
meshSource->AddPoint( 3, 0, 0 ),
meshSource->AddPoint( 4, 0, 0 ),
meshSource->AddPoint( 3, 1, 0 ),
meshSource->AddPoint( 4, 1, 0 ),
meshSource->AddPoint( 3, 0, 1 ),
meshSource->AddPoint( 4, 0, 1 ),
meshSource->AddPoint( 3, 1, 1 ),
meshSource->AddPoint( 4, 1, 1 )
);
try
{
meshSource->Update();
}
catch( itk::ExceptionObject & exp )
{
std::cerr << "Exception thrown during Update() " << std::endl;
std::cerr << exp << std::endl;
return EXIT_FAILURE;
}
MeshType* mesh = meshSource->GetOutput();
// Print out the resulting mesh data.
std::cout << MeshType::Pointer( mesh ) << std::endl;
// ... In more detail.
unsigned long i;
std::cout << mesh->GetNumberOfPoints() << " points:" << std::endl;
for( i = 0; i < mesh->GetNumberOfPoints(); i++ )
{
PointType point;
bool dummy = mesh->GetPoint( i, &point );
if( dummy )
{
std::cout << i << ": " << point << std::endl;
}
}
std::cout << "\n" << mesh->GetNumberOfCells() << " cells:" << std::endl;
for( i = 0; i < mesh->GetNumberOfCells(); i++ )
{
typedef MeshType::CellAutoPointer CellAutoPointer;
CellAutoPointer cell;
if( mesh->GetCell( i, cell ) )
{
std::cout << i << ": ";
typedef CellType::PointIdConstIterator PointIdIterator;
PointIdIterator pointIter = cell->PointIdsBegin();
PointIdIterator pointsEnd = cell->PointIdsEnd();
while( pointIter != pointsEnd )
{
std::cout << *pointIter << " ";
++pointIter;
}
std::cout << std::endl;
}
}
std::cout << "\n";
for( i = 0; i < mesh->GetNumberOfCells(); i++ )
{
typedef MeshType::CellAutoPointer CellAutoPointer;
CellAutoPointer cell;
if( mesh->GetCell( i, cell ) )
{
if( cell->GetType() == CellType::LINE_CELL )
{
std::cout << "Cell " << i << ":\n";
typedef MeshSourceType::IdentifierType IdentifierType;
typedef std::set<IdentifierType> NeighborSet;
NeighborSet cellSet;
mesh->GetCellBoundaryFeatureNeighbors( 0, i, 0, &cellSet );
std::cout << "Neighbors across vertex 0: ";
for( NeighborSet::iterator neighborIter = cellSet.begin();
neighborIter != cellSet.end(); ++neighborIter )
{
std::cout << *neighborIter << " ";
}
std::cout << "\n";
mesh->GetCellBoundaryFeatureNeighbors( 0, i, 1, &cellSet );
std::cout << "Neighbors across vertex 1: ";
for( NeighborSet::iterator neighborIter = cellSet.begin();
neighborIter != cellSet.end(); ++neighborIter )
{
std::cout << *neighborIter << " ";
}
std::cout << "\n";
mesh->GetCellNeighbors( i, &cellSet );
std::cout << "Neighbors having edge as boundary: ";
for( NeighborSet::iterator neighborIter = cellSet.begin();
neighborIter != cellSet.end(); ++neighborIter )
{
std::cout << *neighborIter << " ";
}
std::cout << "\n" << std::endl;
}
}
}
// Check that the right number of points has been added.
unsigned long numPoints = mesh->GetNumberOfPoints();
if( numPoints != 17 )
{
std::cerr << "Mesh shows " << numPoints
<< " points, but 17 were added." << std::endl;
return EXIT_FAILURE;
}
// Check that the right number of cells has been added.
unsigned long numCells = mesh->GetNumberOfCells();
numCells += mesh->GetNumberOfEdges();
if( numCells != 53 )
{
std::cerr << "Mesh shows "
<< numCells
<< " cells, but 53 were added." << std::endl;
return EXIT_FAILURE;
}
// Check that the output is not destroyed when calling Update()
meshSource->Update();
numPoints = meshSource->GetOutput()->GetNumberOfPoints();
numCells = meshSource->GetOutput()->GetNumberOfCells();
numCells += meshSource->GetOutput()->GetNumberOfEdges();
if( numPoints != 17 || numCells != 53 )
{
std::cerr << "Mesh is being changed when invoking Update()" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -