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
|
/*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include <iostream>
#include "itkChainCodePath.h"
int itkChainCodePathTest(int, char*[])
{
typedef itk::ChainCodePath<2> PathType;
typedef PathType::IndexType IndexType;
typedef PathType::OffsetType OffsetType;
bool passed = true;
IndexType index;
OffsetType offset;
PathType::Pointer path = PathType::New();
index[0]=3;
index[1]=5;
path->SetStart(index);
offset[0]=0; offset[1]=1; path->InsertStep(0, offset);
offset[0]=1; offset[1]=1; path->InsertStep(1, offset);
offset[0]=1; offset[1]=0; path->InsertStep(2, offset);
offset[0]=1; offset[1]=-1; path->InsertStep(3, offset);
offset[0]=0; offset[1]=-1; path->InsertStep(4, offset);
offset[0]=-1; offset[1]=-1; path->InsertStep(5, offset);
offset[0]=-1; offset[1]=0; path->InsertStep(6, offset);
offset[0]=-1; offset[1]=1; path->InsertStep(7, offset);
std::cout << "Path is " << path->NumberOfSteps() << " steps" << std::endl;
offset[0]=0; offset[1]=-1;
path->InsertStep(3,offset); // insert new step 3
offset = path->Evaluate(3);
std::cout <<"Inserted new step[3] = "<<offset<<std::endl;
offset[0]=1; offset[1]=0;
path->ChangeStep(4,offset); // rotate the down-right step (now step 4) CCW
offset = path->Evaluate(4);
std::cout <<"Changed step[4] to "<<offset<<std::endl;
std::cout << "Path is " << path->NumberOfSteps() << " steps" << std::endl;
if( path->NumberOfSteps() != 9 )
{
passed = false;
}
index=path->GetStart();
std::cout <<"Starting at index "<<index << std::endl;
for(unsigned int input=0;;)
{
offset=path->IncrementInput(input);
if( offset[0] || offset[1] )
{
index=path->EvaluateToIndex(input);
std::cout <<"Step["<<input-1<<"] is "<<offset;
std::cout <<"\t to index "<<index << std::endl;
}
else
break;
}
if( index != path->GetStart() )
{
passed = false;
}
if (passed)
{
std::cout << "ChainCode tests passed" << std::endl;
return EXIT_SUCCESS;
}
else
{
std::cout << "ChainCode tests failed" << std::endl;
return EXIT_FAILURE;
}
}
|
