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
|
/*=========================================================================
*
* 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 "itkVoronoiDiagram2DGenerator.h"
#include "itkMeshSource.h"
#include "itkMeshFileWriter.h"
#include "itkTestingMacros.h"
int itkVoronoiDiagram2DTest( int argc, char* argv[] )
{
if( argc != 2 )
{
std::cerr << "Usage: itkVoronoiDiagram2DTest outputFileName" << std::endl;
return EXIT_FAILURE;
}
const double height = 400;
const double width = 400;
const unsigned int numberOfSeeds = 20;
typedef itk::VoronoiDiagram2D< double > VoronoiDiagram;
typedef itk::VoronoiDiagram2DGenerator< double > VoronoiDiagramGenerator;
typedef VoronoiDiagram::PointType PointType;
typedef VoronoiDiagram::CellType CellType;
typedef VoronoiDiagram::CellAutoPointer CellAutoPointer;
typedef CellType::PointIdIterator PointIdIterator;
typedef VoronoiDiagram::NeighborIdIterator NeighborIdIterator;
VoronoiDiagram::Pointer voronoiDiagram = VoronoiDiagram::New();
VoronoiDiagramGenerator::Pointer voronoiDiagramGenerator =
VoronoiDiagramGenerator::New();
EXERCISE_BASIC_OBJECT_METHODS ( voronoiDiagramGenerator, VoronoiDiagram2DGenerator,
MeshSource );
PointType insize;
insize[0] = width;
insize[1] = height;
voronoiDiagramGenerator->SetBoundary(insize);
voronoiDiagramGenerator->SetRandomSeeds(numberOfSeeds);
TEST_SET_GET_VALUE( numberOfSeeds, voronoiDiagramGenerator->GetNumberOfSeeds() );
voronoiDiagramGenerator->Update();
voronoiDiagram = voronoiDiagramGenerator->GetOutput();
for( unsigned int i = 0; i < voronoiDiagramGenerator->GetNumberOfSeeds(); ++i )
{
PointType currP = voronoiDiagram->GetSeed(i);
std::cout << "Seed No." << i << ": At (" << currP[0] << "," << currP[1] << ")" << std::endl;
std::cout << "Boundary Vertices List (in order): ";
CellAutoPointer currCell;
voronoiDiagram->GetCellId(i, currCell);
PointIdIterator currCellP;
for( currCellP = currCell->PointIdsBegin(); currCellP != currCell->PointIdsEnd(); ++currCellP )
{
std::cout << *currCellP << ",";
}
std::cout << std::endl;
std::cout << " Neighbors (Seed No.): ";
NeighborIdIterator currNeibor;
for( currNeibor = voronoiDiagram->NeighborIdsBegin(i);
currNeibor != voronoiDiagram->NeighborIdsEnd(i); ++currNeibor )
{
std::cout << *currNeibor << ",";
}
std::cout << std::endl << std::endl;
}
std::cout << "Vertices Informations:" << std::endl;
VoronoiDiagram::VertexIterator allVerts;
int j = 0;
for( allVerts = voronoiDiagram->VertexBegin();
allVerts != voronoiDiagram->VertexEnd(); ++allVerts )
{
std::cout << "Vertices No. " << j;
j++;
std::cout << ": At (" << allVerts.Value()[0] << ","
<< allVerts.Value()[1] << ")" << std::endl;
}
typedef itk::MeshFileWriter< VoronoiDiagram > WriterType;
WriterType::Pointer writer = WriterType::New();
writer->SetInput( voronoiDiagram );
writer->SetFileName( argv[1] );
try
{
writer->Update();
}
catch( itk::ExceptionObject & excp )
{
std::cout << excp << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
