File: itkVoronoiDiagram2D.txx

package info (click to toggle)
insighttoolkit 3.6.0-3
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 94,956 kB
  • ctags: 74,981
  • sloc: cpp: 355,621; ansic: 195,070; fortran: 28,713; python: 3,802; tcl: 1,996; sh: 1,175; java: 583; makefile: 415; csh: 184; perl: 175
file content (205 lines) | stat: -rw-r--r-- 4,777 bytes parent folder | download
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
193
194
195
196
197
198
199
200
201
202
203
204
205
/*=========================================================================

  Program:   Insight Segmentation & Registration Toolkit
  Module:    $RCSfile: itkVoronoiDiagram2D.txx,v $
  Language:  C++
  Date:      $Date: 2003-09-10 14:28:40 $
  Version:   $Revision: 1.14 $

  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.

=========================================================================*/
#ifndef _itkVoronoiDiagram2D_txx
#define _itkVoronoiDiagram2D_txx
#include "itkVoronoiDiagram2D.h"


#include <algorithm>
#include "vnl/vnl_sample.h"

namespace itk{

template <typename TCoordRepType>
VoronoiDiagram2D<TCoordRepType>::
VoronoiDiagram2D()
{
  m_NumberOfSeeds = 0;
}

template <typename TCoordRepType>
VoronoiDiagram2D<TCoordRepType>::
~VoronoiDiagram2D()
{
}

template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
PrintSelf(std::ostream& os, Indent indent) const
{
  Superclass::PrintSelf(os, indent);
  os << indent << "Number Of Seeds: " 
     << m_NumberOfSeeds << std::endl;
}


/* Set the seed points, specify the number of seeds as "num". */
template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
SetSeeds(int num,  SeedsIterator begin)
{
  m_Seeds.clear();
  SeedsIterator ii(begin);
  for(int i = 0; i < num; ++i){
  m_Seeds.push_back(*ii++);
  }
  m_NumberOfSeeds = num;
}

/* Set the rectangle that encloses the Voronoi Diagram. */
template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
SetBoundary(PointType vorsize)
{
  m_VoronoiBoundary[0] = vorsize[0];
  m_VoronoiBoundary[1] = vorsize[1];
}

template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
SetOrigin(PointType vorsize)
{
  m_VoronoiBoundaryOrigin[0] = vorsize[0];
  m_VoronoiBoundaryOrigin[0] = vorsize[1];
}


template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
GetPoint(int pId, PointType *answer)
{ 
  (*answer)[0] = f_VertexList[pId][0];
  (*answer)[1] = f_VertexList[pId][1];
}
 

template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
GetCellId(CellIdentifier cellId, CellAutoPointer & cellPtr )
{
  cellPtr.TakeNoOwnership( m_VoronoiRegions[cellId] );
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::EdgeInfo 
VoronoiDiagram2D<TCoordRepType>::
GetSeedsIDAroundEdge(VoronoiEdge *task)
{
  EdgeInfo answer;
  answer[0]=f_LineList[task->m_LineID][0];
  answer[1]=f_LineList[task->m_LineID][1];
  return (answer);
}


template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::VoronoiEdgeIterator 
VoronoiDiagram2D<TCoordRepType>::
EdgeBegin(void)
{
  return f_EdgeList.begin();
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::VoronoiEdgeIterator 
VoronoiDiagram2D<TCoordRepType>::
EdgeEnd(void)
{
  return f_EdgeList.end();
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::NeighborIdIterator 
VoronoiDiagram2D<TCoordRepType>::
NeighborIdsBegin(int seeds)
{
  return m_CellNeighborsID[seeds].begin();
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::NeighborIdIterator 
VoronoiDiagram2D<TCoordRepType>::
NeighborIdsEnd(int seeds)
{
  return m_CellNeighborsID[seeds].end();
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::VertexIterator 
VoronoiDiagram2D<TCoordRepType>::
VertexBegin(void)
{
  return f_VertexList.begin();
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::VertexIterator 
VoronoiDiagram2D<TCoordRepType>::
VertexEnd(void)
{
  return f_VertexList.end();
}

template <typename TCoordRepType>
typename VoronoiDiagram2D<TCoordRepType>::PointType 
VoronoiDiagram2D<TCoordRepType>::
GetSeed(int SeedID)
{
  PointType answer;
  answer[0]=m_Seeds[SeedID][0];
  answer[1]=m_Seeds[SeedID][1];
  return answer;
}

template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
Reset(void)
{
  m_VoronoiRegions.clear();
  m_VoronoiRegions.resize(m_NumberOfSeeds);
  m_CellNeighborsID.resize(m_NumberOfSeeds);

  for(unsigned int i = 0; i < m_NumberOfSeeds; i++)
    {
    m_VoronoiRegions[i] = new CellType;
    m_CellNeighborsID[i].clear();
    }  
}

template <typename TCoordRepType>
void
VoronoiDiagram2D<TCoordRepType>::
InsertCells(void)
{
  genericCellPointer cellPtr;
  for(unsigned int i = 0; i < m_NumberOfSeeds; i++)
    {
    cellPtr.TakeOwnership( m_VoronoiRegions[i] );
    this->SetCell(i, cellPtr );
    }  
}

}//end namespace

#endif