-
Notifications
You must be signed in to change notification settings - Fork 128
Expand file tree
/
Copy pathKDTreeBinding.cpp
More file actions
180 lines (135 loc) · 5.16 KB
/
Copy pathKDTreeBinding.cpp
File metadata and controls
180 lines (135 loc) · 5.16 KB
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
//////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2007-2010, Image Engine Design Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// * Neither the name of Image Engine Design nor the names of any
// other contributors to this software may be used to endorse or
// promote products derived from this software without specific prior
// written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
//////////////////////////////////////////////////////////////////////////
// This include needs to be the very first to prevent problems with warnings
// regarding redefinition of _POSIX_C_SOURCE
#include "boost/python.hpp"
#include "IECorePython/KDTreeBinding.h"
#include "IECore/KDTree.h"
#include "IECore/RefCounted.h"
#include "IECore/TypedData.h"
#include "IECore/VectorTypedData.h"
#include <cassert>
#include <iterator>
#include <string>
using namespace boost::python;
using namespace IECore;
namespace IECorePython
{
template<typename T>
void bindKDTree(const char *bindName);
void bindKDTree()
{
bindKDTree< V2fTree >("V2fTree");
bindKDTree< V2dTree >("V2dTree");
bindKDTree< V3fTree >("V3fTree");
bindKDTree< V3dTree >("V3dTree");
}
template<typename T>
struct KDTreeWrapper
{
typedef Imath::Box<typename T::Point> Box;
typedef TypedData<std::vector<typename T::Point> > PointData;
IE_CORE_DECLAREPTR( PointData )
T* m_tree;
PointDataPtr m_points;
KDTreeWrapper(PointDataPtr points)
{
m_points = points->copy();
m_tree = new T(m_points->readable().begin(), m_points->readable().end());
}
virtual ~KDTreeWrapper()
{
assert(m_tree);
delete m_tree;
}
size_t nearestNeighbour( const typename T::Point &p)
{
assert(m_tree);
typename T::Iterator it = m_tree->nearestNeighbour(p);
return std::distance( m_points->readable().begin(), it );
}
IntVectorDataPtr nearestNeighbours(const typename T::Point &p, typename T::Point::BaseType r)
{
assert(m_tree);
typedef std::vector<typename T::Iterator> PointArray;
PointArray points;
unsigned int num = m_tree->nearestNeighbours(p, r, points);
IntVectorDataPtr indices = new IntVectorData();
indices->writable().reserve( num );
for (typename PointArray::const_iterator it = points.begin(); it != points.end(); ++it)
{
indices->writable().push_back( std::distance( m_points->readable().begin(), *it ) );
}
return indices;
}
IntVectorDataPtr nearestNNeighbours(const typename T::Point &p, unsigned int numNeighbours)
{
assert(m_tree);
typedef std::vector<typename T::Neighbour> NeighbourArray;
NeighbourArray points;
unsigned int num = m_tree->nearestNNeighbours(p, numNeighbours, points);
IntVectorDataPtr indices = new IntVectorData();
indices->writable().reserve( num );
for (typename NeighbourArray::const_iterator it = points.begin(); it != points.end(); ++it)
{
indices->writable().push_back( std::distance( m_points->readable().begin(), it->point ) );
}
return indices;
}
IntVectorDataPtr enclosedPoints( const Box &bound )
{
typedef std::vector<typename T::Iterator> PointArray;
PointArray points;
m_tree->enclosedPoints( bound, std::back_insert_iterator<PointArray>( points ) );
IntVectorDataPtr indices = new IntVectorData();
indices->writable().reserve( points.size() );
for (typename PointArray::const_iterator it = points.begin(); it != points.end(); ++it)
{
indices->writable().push_back( std::distance( m_points->readable().begin(), *it ) );
}
return indices;
}
};
template<typename T>
void bindKDTree(const char *bindName)
{
class_<KDTreeWrapper<T>, boost::noncopyable>(bindName, no_init)
.def(init< typename KDTreeWrapper<T>::PointDataPtr >() )
.def("nearestNeighbour", &KDTreeWrapper<T>::nearestNeighbour )
.def("nearestNeighbours", &KDTreeWrapper<T>::nearestNeighbours )
.def("nearestNNeighbours", &KDTreeWrapper<T>::nearestNNeighbours )
.def("enclosedPoints", &KDTreeWrapper<T>::enclosedPoints )
;
}
}