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
117
118
119
120
121
122
123
124
125
|
/*=========================================================================
*
* 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 "itkPolyLineParametricPath.h"
#include "itkTestingMacros.h"
int itkPolyLineParametricPathTest( int, char* [] )
{
const unsigned int Dimension = 2;
typedef itk::PolyLineParametricPath< Dimension > PathType;
typedef PathType::InputType InputType;
typedef PathType::OffsetType OffsetType;
typedef PathType::VertexType VertexType;
bool passed = true;
InputType input;
OffsetType offset;
VertexType v;
PathType::Pointer path = PathType::New();
EXERCISE_BASIC_OBJECT_METHODS( path, PolyLineParametricPath, ParametricPath );
v.Fill(1);
path->AddVertex( v );
v[0] = 2;
v[1] = 3;
path->AddVertex( v );
v[0] = 3;
v[1] = 4;
path->AddVertex( v );
v[0] = 0;
v[1] = 5;
path->AddVertex( v );
v.Fill( 1 );
path->AddVertex( v );
std::cout << "Evaluating at 0, 0.5, and 4.0: " << path->Evaluate( 0 ) << ", "
<< path->Evaluate( 0.5 ) << ", " << path->Evaluate( 4.0 ) << std::endl;
std::cout << "Evaluating to an index at 0, 0.5, and 1.0: "
<< path->EvaluateToIndex( 0 ) << ", " << path->EvaluateToIndex( 0.5 )
<< ", " << path->EvaluateToIndex( 1.0 ) << std::endl;
if( path->EvaluateToIndex( 4.0 ) != path->EvaluateToIndex( 0 ) )
{
std::cout << "EvaluateToIndex() Failed" << std::endl;
passed = false;
}
std::cout << "Evaluating the derivative at 0, 0.5, and 1.0: "
<< path->EvaluateDerivative( 0 ) << ", " << path->EvaluateDerivative( 0.5 )
<< ", " << path->EvaluateDerivative(1.0) << std::endl;
if( int( 0.5 + 1000 * ( path->EvaluateDerivative( 0.5 ) )[0]) != 1000 ||
int( 0.5 + 1000 * ( path->EvaluateDerivative( 0.5 ) )[1]) != 2000 )
{
std::cout << "EvaluateDerivative() Failed" << std::endl;
passed = false;
}
input = 0;
offset = path->IncrementInput( input );
std::cout << "Incrementing the input from 0 to " << input << ": " << offset << std::endl;
input = 0.5;
offset = path->IncrementInput( input );
std::cout << "Incrementing the input from 0.5 to " << input << ": " << offset << std::endl;
// Test a degenerate path
std::cout << "Generating degenerate path" << std::endl;
PathType::Pointer path2 = PathType::New();
// Add a bunch of points closely spaced together
for( double k = 0; k < 10; k += 0.1 )
{
v.Fill( k );
path2->AddVertex( v );
}
// Add a point that is very far away from the first points
v.Fill( 100 );
path2->AddVertex( v );
PathType::InputType path2Input = path2->StartOfInput();
PathType::OffsetType zeroOffset;
zeroOffset.Fill( 0 );
std::cout << "Starting degenerate path test" << std::endl;
while( true )
{
offset = path2->IncrementInput( path2Input );
if( offset == zeroOffset )
{
break;
}
}
if( passed )
{
std::cout << "Test passed" << std::endl;
return EXIT_SUCCESS;
}
else
{
std::cout << "Test failed" << std::endl;
return EXIT_FAILURE;
}
}
|
