1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
|
/*=========================================================================
Program: Visualization Toolkit
Module: TestPolyhedronCutter.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/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 notice for more information.
=========================================================================*/
#include "vtkCutter.h"
#include "vtkPlane.h"
#include "vtkPolygon.h"
#include "vtkUnstructuredGrid.h"
#include "vtkXMLUnstructuredGridReader.h"
#include <set>
int TestPolyhedronCutter(int argc, char* argv[])
{
vtkObject::GlobalWarningDisplayOff();
vtkNew<vtkXMLUnstructuredGridReader> r;
if (argc < 3)
{
cout << "Not enough arguments. Passing test nonetheless.";
return EXIT_SUCCESS;
}
char* fname = argv[1];
r->SetFileName(fname);
r->Update();
vtkUnstructuredGrid* grid = r->GetOutput();
if (grid->GetNumberOfCells() != 1)
{
return EXIT_FAILURE;
}
vtkNew<vtkCutter> cut;
vtkNew<vtkPlane> cutPlane;
cutPlane->SetOrigin(0, 0, 350);
cutPlane->SetNormal(1, 0, 0);
cut->GenerateTrianglesOff();
cut->SetCutFunction(cutPlane);
cut->AddInputConnection(r->GetOutputPort());
cut->Update();
vtkPolyData* result = cut->GetOutput();
if (!result)
{
return EXIT_FAILURE;
}
if (result->GetNumberOfCells() != 1)
{
return EXIT_FAILURE;
}
vtkCell* aCell = result->GetCell(0);
vtkPolygon* cell = vtkPolygon::SafeDownCast(aCell);
if (!cell)
{
return EXIT_FAILURE;
}
if (cell->GetNumberOfEdges() != 5)
{
cerr << "The resulting polygon consists of " << cell->GetNumberOfEdges()
<< " edges instead of the expected 5 edges." << endl;
return EXIT_FAILURE;
}
vtkIdList* ids = cell->GetPointIds();
std::set<vtkIdType> uniqueIds;
for (int i = 0; i < 5; ++i)
{
uniqueIds.insert(ids->GetId(i));
}
if (uniqueIds.size() != 5)
{
cerr << "The resulting polygon consists of invalid edges" << endl;
return EXIT_FAILURE;
}
// For the second slice operation, the only requirement (currently) is that it returns *a result*
fname = argv[2];
r->SetFileName(fname);
r->Update();
grid = r->GetOutput();
if (grid->GetNumberOfCells() <= 0)
{
return EXIT_FAILURE;
}
cut->Update();
result = cut->GetOutput();
if (!result || result->GetNumberOfCells() <= 0)
{
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|