⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 itksimplexmeshtest.cxx

📁 DTMK软件开发包,此为开源软件,是一款很好的医学图像开发资源.
💻 CXX
字号:
/*=========================================================================

Program:   Insight Segmentation & Registration Toolkit
Module:    $RCSfile: itkSimplexMeshTest.cxx,v $
Language:  C++
Date:      $Date: 2004-07-31 22:37:40 $
Version:   $Revision: 1.13 $

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 <iostream>
#include <time.h>

#include "itkMesh.h"
#include "itkSimplexMesh.h"
#include "itkSimplexMeshGeometry.h"
#include "itkDefaultDynamicMeshTraits.h"
#include "itkTimeProbe.h"

int itkSimplexMeshTest(int , char *[] )
{ 
  
  // Declare the type of the input and output mesh
  typedef itk::DefaultDynamicMeshTraits<double, 3, 3, double, double, double> MeshTraits;

  typedef itk::SimplexMesh<double,3,MeshTraits>           SimplexMeshType;

  typedef itk::SimplexMeshGeometry                        SimplexMeshGeometryType;

  typedef SimplexMeshType::CellType                       CellInterfaceType;

  SimplexMeshType::Pointer simplexMesh = SimplexMeshType::New();

  typedef  SimplexMeshType::NeighborListType              NeighborsListType;

  NeighborsListType* neighbors = NULL;

  /**
   * Define the 3d geometric positions for 8 points in a cube.
   */
  SimplexMeshType::CoordRepType testPointCoords[8][3]
    = { {0,0,0}, {9,0,0}, {9,0,9}, {0,0,9},
        {0,9,0}, {9,9,0}, {9,9,9}, {0,9,9} };
  

  /**
   * Typedef the generic cell type for the mesh.  It is an abstract class,
   * so we can only use information from it, like get its pointer type.
   */
  typedef SimplexMeshType::CellType       CellType;
  typedef CellType::CellAutoPointer       CellAutoPointer;
  typedef SimplexMeshType::PointType      PointType;

  /**
   * Add our test points to the mesh.
   * simplexMesh->SetPoint(pointId, point)
   * Note that the constructor for Point is public, and takes an array
   * of coordinates for the point.
   */
  for(int i=0; i < 8 ; ++i)
    {
    simplexMesh->SetPoint(i, PointType(testPointCoords[i]));
    simplexMesh->SetGeometryData(i, new SimplexMeshGeometryType );
    }

  /** 
   * Specify the method used for allocating cells
   */
   simplexMesh->SetCellsAllocationMethod( SimplexMeshType::CellsAllocatedDynamicallyCellByCell );


   /**
    * Excercise the AddEdge method
    */
  simplexMesh->AddEdge( 0, 1 );
  simplexMesh->AddEdge( 0, 3 );
  simplexMesh->AddEdge( 0, 4 );
  simplexMesh->AddEdge( 1, 2 );
  simplexMesh->AddEdge( 1, 5 );
  simplexMesh->AddEdge( 2, 3 );
  simplexMesh->AddEdge( 2, 6 );
  simplexMesh->AddEdge( 3, 7 );
  simplexMesh->AddEdge( 4, 5 );
  simplexMesh->AddEdge( 4, 7 );
  simplexMesh->AddEdge( 5, 6 );
  simplexMesh->AddEdge( 6, 7 );

   /**
    * Excercise the AddNeighbor method
    */
  simplexMesh->AddNeighbor( 0, 1 );
  simplexMesh->AddNeighbor( 0, 3 );
  simplexMesh->AddNeighbor( 0, 4 );
  simplexMesh->AddNeighbor( 1, 2 );
  simplexMesh->AddNeighbor( 1, 5 );
  simplexMesh->AddNeighbor( 2, 3 );
  simplexMesh->AddNeighbor( 2, 6 );
  simplexMesh->AddNeighbor( 3, 7 );
  simplexMesh->AddNeighbor( 4, 5 );
  simplexMesh->AddNeighbor( 4, 7 );
  simplexMesh->AddNeighbor( 5, 6 );
  simplexMesh->AddNeighbor( 6, 7 );


  // Now add the symmetric relationships
  simplexMesh->AddNeighbor( 1, 0 );
  simplexMesh->AddNeighbor( 3, 0 );
  simplexMesh->AddNeighbor( 4, 0 );
  simplexMesh->AddNeighbor( 2, 1 );
  simplexMesh->AddNeighbor( 5, 1 );
  simplexMesh->AddNeighbor( 3, 2 );
  simplexMesh->AddNeighbor( 6, 2 );
  simplexMesh->AddNeighbor( 7, 3 );
  simplexMesh->AddNeighbor( 5, 4 );
  simplexMesh->AddNeighbor( 7, 4 );
  simplexMesh->AddNeighbor( 6, 5 );
  simplexMesh->AddNeighbor( 7, 6 );



    
  itk::TimeProbe timeProbe;

  for (unsigned int i=0; i < 2; i++)
    {  
    timeProbe.Start();
    for (unsigned int pointIndex = 0; pointIndex < simplexMesh->GetPoints()->Size(); pointIndex++)
      {
      neighbors = simplexMesh->GetNeighbors( pointIndex, i, neighbors );
      }
    timeProbe.Stop();
    if (neighbors)
      {
      std::cout << "Rigidity: " << i << ", neighbor list size: " << neighbors->size() << std::endl;
      delete neighbors;
      neighbors = NULL;
      }

    std::cout << ", Elapsed time (for getting neighbors): " << timeProbe.GetMeanTime() << std::endl;
    }

    

  std::cout << "[TEST DONE]" << std::endl;
  return EXIT_SUCCESS;

}




⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -