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
|
/*=========================================================================
*
* Copyright NumFOCUS
*
* 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
*
* https://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.
*
*=========================================================================*/
#ifndef itkLevelSetDomainPartitionImageWithKdTree_hxx
#define itkLevelSetDomainPartitionImageWithKdTree_hxx
namespace itk
{
template <typename TImage>
LevelSetDomainPartitionImageWithKdTree<TImage>::LevelSetDomainPartitionImageWithKdTree()
: m_KdTree(nullptr)
{}
template <typename TImage>
void
LevelSetDomainPartitionImageWithKdTree<TImage>::PopulateListDomain()
{
if (this->m_KdTree.IsNotNull())
{
this->PopulateDomainWithKdTree();
}
else
{
Superclass::PopulateListDomain();
}
}
template <typename TImage>
void
LevelSetDomainPartitionImageWithKdTree<TImage>::PopulateDomainWithKdTree()
{
Superclass::AllocateListDomain();
const ListRegionType region = this->m_ListDomain->GetLargestPossibleRegion();
for (ListIteratorType lIt(this->m_ListDomain, region); !lIt.IsAtEnd(); ++lIt)
{
const ListIndexType & index = lIt.GetIndex();
ListPointType pt;
this->m_ListDomain->TransformIndexToPhysicalPoint(index, pt);
CentroidVectorType queryPoint = pt.GetVectorFromOrigin();
typename TreeType::InstanceIdentifierVectorType neighbors;
this->m_KdTree->Search(queryPoint, this->m_NumberOfNeighbors, neighbors);
IdentifierListType identifierList;
for (NeighborsIdType i = 0; i < this->m_NumberOfNeighbors; ++i)
{
IdentifierType levelSetID = neighbors[i];
if (this->m_LevelSetDomainRegionVector[levelSetID].IsInside(index))
{
identifierList.push_back(neighbors[i]);
}
}
lIt.Set(identifierList);
}
}
} // end namespace itk
#endif
|
