| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * Copyright (c) 2000-2022 Inria | ||
| 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 | * Contact: Bruno Levy | ||
| 30 | * | ||
| 31 | * https://www.inria.fr/fr/bruno-levy | ||
| 32 | * | ||
| 33 | * Inria, | ||
| 34 | * Domaine de Voluceau, | ||
| 35 | * 78150 Le Chesnay - Rocquencourt | ||
| 36 | * FRANCE | ||
| 37 | * | ||
| 38 | */ | ||
| 39 | |||
| 40 | #ifndef __NN_SEARCH_ANN__ | ||
| 41 | #include <geogram/points/nn_search.h> | ||
| 42 | |||
| 43 | #ifdef GEOGRAM_USE_BUILTIN_DEPS | ||
| 44 | #include "third_party/ANN/ANN.h" | ||
| 45 | #else | ||
| 46 | #include <ANN/ANN.h> | ||
| 47 | #endif | ||
| 48 | |||
| 49 | namespace GEO { | ||
| 50 | |||
| 51 | /** | ||
| 52 | * \brief Implementation of NearestNeighborSearch using the ANN library. | ||
| 53 | * \details Used for testing the implementation of KdTree in Geogram. | ||
| 54 | */ | ||
| 55 | class NearestNeighborSearch_ANN : public NearestNeighborSearch { | ||
| 56 | public: | ||
| 57 | /** | ||
| 58 | * \brief Constructs a new NearestNeighborSearch_ANN. | ||
| 59 | * \param[in] dim dimension of the points | ||
| 60 | */ | ||
| 61 | NearestNeighborSearch_ANN( | ||
| 62 | coord_index_t dim | ||
| 63 | ); | ||
| 64 | |||
| 65 | virtual void set_points(index_t nb_points, const double* points); | ||
| 66 | |||
| 67 | virtual bool stride_supported() const ; | ||
| 68 | |||
| 69 | virtual void set_points( | ||
| 70 | index_t nb_points, const double* points, index_t stride | ||
| 71 | ); | ||
| 72 | |||
| 73 | virtual void get_nearest_neighbors( | ||
| 74 | index_t nb_neighbors, | ||
| 75 | const double* query_point, | ||
| 76 | index_t* neighbors, | ||
| 77 | double* neighbors_sq_dist | ||
| 78 | ) const; | ||
| 79 | |||
| 80 | protected: | ||
| 81 | /** | ||
| 82 | * \brief NearestNeighborSearch_ANN destructor | ||
| 83 | */ | ||
| 84 | virtual ~NearestNeighborSearch_ANN(); | ||
| 85 | |||
| 86 | protected: | ||
| 87 | #ifndef ANN_CONTIGUOUS_POINT_ARRAY | ||
| 88 | std::vector<ANNcoord*> ann_points_; | ||
| 89 | #endif | ||
| 90 | ANNpointSet* ann_tree_; | ||
| 91 | }; | ||
| 92 | |||
| 93 | /************************************************/ | ||
| 94 | |||
| 95 | class NearestNeighborSearch_ANN_BruteForce : | ||
| 96 | public NearestNeighborSearch_ANN { | ||
| 97 | public: | ||
| 98 | NearestNeighborSearch_ANN_BruteForce( | ||
| 99 | coord_index_t dim | ||
| 100 | ✗ | ) : NearestNeighborSearch_ANN(dim) { | |
| 101 | } | ||
| 102 | |||
| 103 | virtual void set_points( | ||
| 104 | index_t nb_points, const double* points, index_t stride | ||
| 105 | ); | ||
| 106 | }; | ||
| 107 | |||
| 108 | /************************************************/ | ||
| 109 | |||
| 110 | } | ||
| 111 | |||
| 112 | #endif | ||
| 113 |