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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkVoronoiDiagram2DTest.cxx,v $
Language: C++
Date: $Date: 2007-08-20 12:47:12 $
Version: $Revision: 1.12 $
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 "itkVoronoiDiagram2D.h"
#include "itkVoronoiDiagram2DGenerator.h"
#include <stdio.h>
int itkVoronoiDiagram2DTest(int, char* [] ){
const double HEI=400;
const double WID=400;
const int NUMSEEDS=20;
typedef itk::VoronoiDiagram2D<double> Vor;
typedef itk::VoronoiDiagram2DGenerator<double> VorGenerator;
typedef Vor::PointType PointType;
typedef Vor::CellType CellType;
typedef Vor::CellAutoPointer CellAutoPointer;
typedef CellType::PointIdIterator PointIdIterator;
typedef Vor::NeighborIdIterator NeighborIdIterator;
Vor::Pointer testVor(Vor::New());
VorGenerator::Pointer testVorGen(VorGenerator::New());
PointType insize;
insize[0]=WID;
insize[1]=HEI;
testVorGen->SetBoundary(insize);
testVorGen->SetRandomSeeds(NUMSEEDS);
testVorGen->Update();
testVor=testVorGen->GetOutput();
for(int i=0;i<NUMSEEDS; i++){
PointType currP=testVor->GetSeed(i);
std::cout<<"Seed No."<<i<<": At ("<<currP[0]<<"," <<currP[1]<<")"<<std::endl;
std::cout<<" Boundary Vertices List (in order):";
CellAutoPointer currCell;
testVor->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=testVor->NeighborIdsBegin(i);currNeibor!=testVor->NeighborIdsEnd(i);++currNeibor)
{
std::cout<<(*currNeibor)<<",";
}
std::cout<<std::endl<<std::endl;
}
std::cout<<"Vertices Informations:"<<std::endl;
Vor::VertexIterator allVerts;
int j = 0;
for(allVerts=testVor->VertexBegin();allVerts!=testVor->VertexEnd();++allVerts)
{
std::cout<<"Vertices No."<<j;
j++;
std::cout<<": At ("<<(*allVerts)[0]<<","<<(*allVerts)[1]<<")"<<std::endl;
}
return EXIT_SUCCESS;
}
|
