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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkQuadEdgeMeshIteratorTest.cxx,v $
Language: C++
Date: $Date: 2009-04-06 00:19:18 $
Version: $Revision: 1.6 $
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 "itkQuadEdgeMesh.h"
#include <iostream>
int itkQuadEdgeMeshIteratorTest( int , char* [] )
{
typedef itk::QuadEdgeMesh< double, 3 > MeshType;
typedef MeshType::QEPrimal QEPrimal;
typedef MeshType::QEPrimal::IteratorGeom IteratorGeom;
std::string indent = " ";
MeshType::Pointer mesh = MeshType::New( );
//
// p2--------------p1 //
// / \ //
// / \ //
// / \ //
// / \ //
// / \ //
// / \ //
// / \ //
// p3 FACE p0 //
// \ / //
// \ / //
// \ / //
// \ / //
// \ / //
// \ / //
// \ / //
// p4---------------p5 //
//
#define NumPoints 6
#define NumEdges 6
MeshType::PixelType a = vcl_sqrt( 3.0 ) / 2.0;
MeshType::PixelType points[ NumPoints ][ 3 ] = { { 1.0, 0.0, 0.0 },
{ 0.5, a, 0.0 },
{ -0.5, a, 0.0 },
{ -1.0, 0.0, 0.0 },
{ -0.5, -a, 0.0 },
{ 0.5, -a, 0.0 } };
MeshType::PointType pnts[ NumPoints ];
MeshType::PointIdentifier pids[ NumPoints ];
for( int i = 0; i < NumPoints; i++ )
{
for( int j = 0; j < 3; j++ )
{
pnts[ i ][ j ] = points[ i ][ j ];
}
pids[ i ] = mesh->AddPoint( pnts[ i ] );
}
for( int i = 0; i < NumPoints; i++ )
{
mesh->AddEdge( pids[ i ], pids[ (i + 1 ) % NumPoints ] );
}
MeshType::QEPrimal* foundEdges[ NumEdges ];
for( int i = 0; i < NumPoints; i++ )
{
foundEdges[ i ] = mesh->FindEdge( pids[ i ] ,
pids[ (i + 1 ) % NumEdges ] );
if( ! foundEdges[ i ] )
{
std::cerr << "Unfound edge ["
<< pids[ i ] << ", "
<< pids[ (i + 1 ) % NumEdges ] << "]. Failed."
<< std::endl;
return EXIT_FAILURE;
}
}
// Create the face:
mesh->AddFace( foundEdges[ 0 ] );
// Coarse checking with the cyclicity
if( foundEdges[ 0 ]->IsLnextGivenSizeCyclic( 6 ) == false )
{
std::cerr << "Lnext cyclicity is not 6 as expected."
<< std::endl;
return EXIT_FAILURE;
}
//////////////////////////////////////////////////////////
int edgeNumber = 0;
std::cout << "Testing Lnext iterator... ";
for( IteratorGeom itLnext = foundEdges[ 0 ]->BeginGeomLnext( );
itLnext != foundEdges[ 0 ]->EndGeomLnext( );
itLnext++, edgeNumber++ )
{
MeshType::QEPrimal* expectedEdge = foundEdges[ edgeNumber ];
MeshType::QEPrimal* currentEdge = itLnext.Value( );
if ( currentEdge != expectedEdge )
{
std::cout << std::endl
<< "Erroneous edge: was expecting ["
<< expectedEdge->GetOrigin( )
<< ", "
<< expectedEdge->GetDestination( )
<< "], but got ["
<< currentEdge->GetOrigin( ) << ", "
<< currentEdge->GetDestination( ) << "]. Failed."
<< std::endl;
return EXIT_FAILURE;
}
}
std::cout << "OK" << std::endl;
//////////////////////////////////////////////////////////
edgeNumber = 0;
std::cout << "Testing Rnext iterator... ";
for( IteratorGeom itRnext = foundEdges[ 0 ]->BeginGeomRnext( );
itRnext != foundEdges[ 0 ]->EndGeomRnext( );
itRnext++, edgeNumber++ )
{
// We stat with [0,1] and should get [0,5], [5,4], [4,3]...
MeshType::QEPrimal* expectedEdge = foundEdges[ ( NumEdges - edgeNumber ) % NumEdges ];
MeshType::QEPrimal* currentEdge = itRnext.Value( );
if ( currentEdge != expectedEdge )
{
std::cout << std::endl
<< "Erroneous edge: was expecting ["
<< expectedEdge->GetOrigin( )
<< ", "
<< expectedEdge->GetDestination( )
<< "], but got ["
<< currentEdge->GetOrigin( ) << ", "
<< currentEdge->GetDestination( ) << "]. Failed."
<< std::endl;
return EXIT_FAILURE;
}
}
std::cout << "OK" << std::endl;
//////////////////////////////////////////////////////////
// Rotating around destination, there is only one other edge
// BeginGeomDnext( ) returns the edge itself to begin with
edgeNumber = 0;
std::cout << "Testing Dnext iterator... ";
for( IteratorGeom itDnext = foundEdges[ 0 ]->BeginGeomDnext( );
itDnext != foundEdges[ 0 ]->EndGeomDnext( );
itDnext++, edgeNumber++ )
{
MeshType::QEPrimal* expectedEdge;
if( edgeNumber )
{
expectedEdge = foundEdges[ edgeNumber ]->GetSym( );
}
else
{
expectedEdge = foundEdges[ edgeNumber ];
}
MeshType::QEPrimal* currentEdge = itDnext.Value( );
if ( currentEdge != expectedEdge )
{
std::cout << std::endl
<< "Erroneous edge: was expecting ["
<< expectedEdge->GetOrigin( )
<< ", "
<< expectedEdge->GetDestination( )
<< "], but got ["
<< currentEdge->GetOrigin( ) << ", "
<< currentEdge->GetDestination( ) << "]. Failed."
<< std::endl;
return EXIT_FAILURE;
}
}
std::cout << "OK" << std::endl;
std::cout << "QuadEdgeMeshIteratorTest Passed !" << std::endl;
return EXIT_SUCCESS;
}
|
