1 /*
2  *  Copyright (c) 2012-2014, Bruno Levy
3  *  All rights reserved.
4  *
5  *  Redistribution and use in source and binary forms, with or without
6  *  modification, are permitted provided that the following conditions are met:
7  *
8  *  * Redistributions of source code must retain the above copyright notice,
9  *  this list of conditions and the following disclaimer.
10  *  * Redistributions in binary form must reproduce the above copyright notice,
11  *  this list of conditions and the following disclaimer in the documentation
12  *  and/or other materials provided with the distribution.
13  *  * Neither the name of the ALICE Project-Team nor the names of its
14  *  contributors may be used to endorse or promote products derived from this
15  *  software without specific prior written permission.
16  *
17  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18  *  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  *  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
21  *  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22  *  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23  *  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24  *  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25  *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26  *  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27  *  POSSIBILITY OF SUCH DAMAGE.
28  *
29  *  If you modify this software, you should include a notice giving the
30  *  name of the person performing the modification, the date of modification,
31  *  and the reason for such modification.
32  *
33  *  Contact: Bruno Levy
34  *
35  *     Bruno.Levy@inria.fr
36  *     http://www.loria.fr/~levy
37  *
38  *     ALICE Project
39  *     LORIA, INRIA Lorraine,
40  *     Campus Scientifique, BP 239
41  *     54506 VANDOEUVRE LES NANCY CEDEX
42  *     FRANCE
43  *
44  */
45 
46 #include "nn_search_ANN.h"
47 
48 namespace GEO {
49 
NearestNeighborSearch_ANN(coord_index_t dim)50     NearestNeighborSearch_ANN::NearestNeighborSearch_ANN(
51         coord_index_t dim
52     ) :
53         NearestNeighborSearch(dim),
54         ann_tree_(nullptr) {
55     }
56 
set_points(index_t nb_points,const double * points)57     void NearestNeighborSearch_ANN::set_points(index_t nb_points, const double* points) {
58         set_points(nb_points, points, dimension());
59     }
60 
stride_supported() const61     bool NearestNeighborSearch_ANN::stride_supported() const {
62         return true;
63     }
64 
set_points(index_t nb_points,const double * points,index_t stride)65     void NearestNeighborSearch_ANN::set_points(
66         index_t nb_points, const double* points, index_t stride
67     ) {
68         nb_points_ = nb_points;
69         points_ = points;
70         stride_ = stride;
71 
72         // Patched ANN so that we no longer need
73         // to generate an array of pointers to
74         // the points, See ANN.h
75 #ifdef ANN_CONTIGUOUS_POINT_ARRAY
76         delete ann_tree_;
77         ann_tree_ = new ANNkd_tree(
78             ANNpointArray(points_, stride_),
79             int(nb_points),
80             int(dimension())
81         );
82 #else
83         delete ann_tree_;
84         ann_tree_ = nullptr;
85         ann_points_.resize(nb_points);
86         for(index_t i = 0; i < nb_points; i++) {
87             ann_points_[i] = const_cast<double*>(points) + stride_ * i;
88         }
89         ann_tree_ = new ANNkd_tree(
90             &ann_points_[0], int(nb_points), int(dimension())
91         );
92 #endif
93     }
94 
get_nearest_neighbors(index_t nb_neighbors,const double * query_point,index_t * neighbors,double * neighbors_sq_dist) const95     void NearestNeighborSearch_ANN::get_nearest_neighbors(
96         index_t nb_neighbors,
97         const double* query_point,
98         index_t* neighbors,
99         double* neighbors_sq_dist
100     ) const {
101         ann_tree_->annkSearch(
102             const_cast<double*>(query_point),
103             int(nb_neighbors), (ANNidxArray) neighbors, neighbors_sq_dist,
104             (exact_ ? 0.0 : 0.1)
105         );
106     }
107 
~NearestNeighborSearch_ANN()108     NearestNeighborSearch_ANN::~NearestNeighborSearch_ANN() {
109         delete ann_tree_;
110         ann_tree_ = nullptr;
111     }
112 
113 }
114 
115 
116