10 _tree = boost::shared_ptr<Tree>(
new Tree());
13 for(
int n=0; n<nPoints; n++)
19 _tree = boost::shared_ptr<Tree>(
new Tree());
33 if (
_tree->size() == 0 ){
39 for(K_neighbor_search::iterator it = search.begin();
43 neighbors[i++] = it->first.index;
CGAL::Orthogonal_k_neighbor_search< Traits > K_neighbor_search
void findNeighbors(const Vec3D &p, const int k, Array< int > &neighbors)
boost::shared_ptr< Tree > _tree
K_neighbor_search::Tree Tree
void insert(const Vec3D &v, const int n)