| 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 GEOGRAM_DELAUNAY_DELAUNAY_NN | ||
| 41 | #define GEOGRAM_DELAUNAY_DELAUNAY_NN | ||
| 42 | |||
| 43 | #include <geogram/basic/common.h> | ||
| 44 | #include <geogram/delaunay/delaunay.h> | ||
| 45 | #include <geogram/points/nn_search.h> | ||
| 46 | #include <geogram/basic/process.h> | ||
| 47 | |||
| 48 | /** | ||
| 49 | * \file geogram/delaunay/delaunay_nn.h | ||
| 50 | * \brief Implementation of Delaunay using nearest neighbors | ||
| 51 | */ | ||
| 52 | |||
| 53 | namespace GEO { | ||
| 54 | |||
| 55 | /** | ||
| 56 | * \brief Delaunay interface for NearestNeighbors search. | ||
| 57 | * \details | ||
| 58 | * This does not fully implement a Delaunay triangulation, | ||
| 59 | * cell-related queries are not implemented. It only | ||
| 60 | * implements neighborhood queries, which are the only ones | ||
| 61 | * needed by RestrictedVoronoiDiagram with radius of security. | ||
| 62 | */ | ||
| 63 | class GEOGRAM_API Delaunay_NearestNeighbors : public Delaunay { | ||
| 64 | public: | ||
| 65 | /** | ||
| 66 | * \brief Creates a new Delaunay_NearestNeighbors. | ||
| 67 | * \param[in] dimension the dimension of the points | ||
| 68 | */ | ||
| 69 | Delaunay_NearestNeighbors(coord_index_t dimension); | ||
| 70 | |||
| 71 | /** | ||
| 72 | * \brief Stores nb neighbors with vertex i. | ||
| 73 | * \details By default, Delaunay::default_nb_neighbors() | ||
| 74 | * are stored for each vertex. This function changes | ||
| 75 | * the number of stored neighbors for a given vertex. | ||
| 76 | * \param[in] i index of the vertex which neighborhood should | ||
| 77 | * be enlarged | ||
| 78 | * \param[in] nb new number of vertices in vertex \p i%'s neighborhood. | ||
| 79 | */ | ||
| 80 | virtual void enlarge_neighborhood(index_t i, index_t nb); | ||
| 81 | |||
| 82 | void set_vertices( | ||
| 83 | index_t nb_vertices, const double* vertices | ||
| 84 | ) override; | ||
| 85 | |||
| 86 | index_t nearest_vertex(const double* p) const override; | ||
| 87 | |||
| 88 | /** | ||
| 89 | * \brief Gets the NearestNeighborSearch used internally. | ||
| 90 | * \return a pointer to the NearestNeighborSearch. | ||
| 91 | */ | ||
| 92 | 48 | NearestNeighborSearch* nn_search() { | |
| 93 | 48 | return NN_; | |
| 94 | } | ||
| 95 | |||
| 96 | public: | ||
| 97 | /** | ||
| 98 | * \brief Used internally for parallel | ||
| 99 | * computation of the neighborhoods | ||
| 100 | * in Delaunay. | ||
| 101 | */ | ||
| 102 | void store_neighbors_CB(index_t i) override; | ||
| 103 | |||
| 104 | protected: | ||
| 105 | /** | ||
| 106 | * \brief Delaunay_NearestNeighbors destructor | ||
| 107 | */ | ||
| 108 | ~Delaunay_NearestNeighbors() override; | ||
| 109 | |||
| 110 | /** | ||
| 111 | * \brief Internal implementation for get_neighbors (with vector). | ||
| 112 | * \param[in] v index of the Delaunay vertex | ||
| 113 | * \param[in,out] neighbors the computed neighbors of vertex \p v. | ||
| 114 | * Its size is used to determine the number of queried neighbors. | ||
| 115 | */ | ||
| 116 | void get_neighbors_internal( | ||
| 117 | index_t v, vector<index_t>& neighbors | ||
| 118 | ) const override; | ||
| 119 | |||
| 120 | /** | ||
| 121 | * \brief Internal implementation for get_neighbors (with pointers). | ||
| 122 | * \param[in] v index of the Delaunay vertex | ||
| 123 | * \param[in] nb_neighbors required number of neighbors | ||
| 124 | * \param[out] neighbors the computed neighbors of vertex \p v, | ||
| 125 | * allocated and managed by caller | ||
| 126 | * \return the obtained number of neighbors (can be | ||
| 127 | * smaller than nb_neighbors if duplicate points | ||
| 128 | * are encountered) | ||
| 129 | */ | ||
| 130 | virtual index_t get_neighbors_internal( | ||
| 131 | index_t v, index_t nb_neighbors, index_t* neighbors | ||
| 132 | ) const; | ||
| 133 | |||
| 134 | private: | ||
| 135 | NearestNeighborSearch_var NN_; | ||
| 136 | }; | ||
| 137 | } | ||
| 138 | |||
| 139 | #endif | ||
| 140 |