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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkPathToChainCodePathFilterTest.cxx,v $
Language: C++
Date: $Date: 2003-09-10 14:30:07 $
Version: $Revision: 1.3 $
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 <iostream>
#include "itkPolyLineParametricPath.h"
#include "itkChainCodePath2D.h"
#include "itkPathToChainCodePathFilter.h"
#include "itkPathIterator.h"
int itkPathToChainCodePathFilterTest(int, char*[])
{
typedef itk::PolyLineParametricPath<2> InPathType;
typedef itk::ChainCodePath2D ChainPathType;
typedef InPathType::VertexType VertexType;
typedef InPathType::OffsetType OffsetType;
typedef InPathType::InputType InPathInputType;
typedef itk::PathToChainCodePathFilter<InPathType,ChainPathType> FilterType;
bool passed = true;
// Setup the path
std::cout << "Making a triangle Path with v0 at (30,30) -> (30,33) -> (33,33)" << std::endl;
VertexType v;
InPathType::Pointer inPath = InPathType::New();
ChainPathType::Pointer chainPath;
v.Fill(30);
inPath->AddVertex(v);
v[0]=30;
v[1]=33;
inPath->AddVertex(v);
v.Fill(33);
inPath->AddVertex(v);
// Setup the filter
FilterType::Pointer filter = FilterType::New();
filter->SetInput(inPath);
chainPath=filter->GetOutput();
chainPath->Update();
std::cout << "PathToChainCodePathFilter: open test path is "
<< chainPath->NumberOfSteps() << " steps:\n \""
<< chainPath->GetChainCodeAsString() << "\"." << std::endl;
if( chainPath->NumberOfSteps() != 6 )
{
passed = false;
}
// close the triangle
v.Fill(30);
inPath->AddVertex(v);
chainPath->Update();
std::cout << "PathToChainCodePathFilter: closed test path is "
<< chainPath->NumberOfSteps() << " steps:\n \""
<< chainPath->GetChainCodeAsString() << "\"." << std::endl;
if( chainPath->NumberOfSteps() != 9 )
{
passed = false;
}
filter->MaximallyConnectedOn();
filter->Update();
std::cout << "PathToChainCodePathFilter: maximally connected test path is "
<< chainPath->NumberOfSteps() << " steps:\n \""
<< chainPath->GetChainCodeAsString() << "\"." << std::endl;
if( chainPath->NumberOfSteps() != 12 )
{
passed = false;
}
if (passed)
{
std::cout << "PathToChainCodePathFilter tests passed" << std::endl;
return EXIT_SUCCESS;
}
else
{
std::cout << "PathToChainCodePathFilter tests failed" << std::endl;
return EXIT_FAILURE;
}
}
|
