| 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_LFS | ||
| 41 | #define GEOGRAM_DELAUNAY_LFS | ||
| 42 | |||
| 43 | #include <geogram/basic/common.h> | ||
| 44 | #include <geogram/delaunay/delaunay.h> | ||
| 45 | |||
| 46 | /** | ||
| 47 | * \file geogram/delaunay/LFS.h | ||
| 48 | * \brief A class for computing local feature size | ||
| 49 | */ | ||
| 50 | |||
| 51 | namespace GEO { | ||
| 52 | |||
| 53 | /** | ||
| 54 | * \brief Computes an approximation of lfs (local feature size). | ||
| 55 | * | ||
| 56 | * Given a surface S and a point p in R^3, lfs(p) corresponds to | ||
| 57 | * the distance between p and the medial axis of S. Given a | ||
| 58 | * sampling of S, this class computes the distance to the nearest pole | ||
| 59 | * (a good approximation of lfs, see Amenta and Bern's paper). | ||
| 60 | */ | ||
| 61 | class GEOGRAM_API LocalFeatureSize { | ||
| 62 | public: | ||
| 63 | /** | ||
| 64 | * \brief Initializes lfs computation. | ||
| 65 | * \param[in] nb_pts number of points | ||
| 66 | * \param[in] pts a sampling of the surface, represented by | ||
| 67 | * a contiguous array of doubles. | ||
| 68 | */ | ||
| 69 | ✗ | LocalFeatureSize(index_t nb_pts, const double* pts) { | |
| 70 | ✗ | sliver_angle_threshold_ = 0.01; | |
| 71 | ✗ | init(nb_pts, pts); | |
| 72 | ✗ | } | |
| 73 | |||
| 74 | /** | ||
| 75 | * \brief Computes the squared local feature size at a query point. | ||
| 76 | * \param[in] p the query point | ||
| 77 | * \return approximate squared local feature size at point \p p. | ||
| 78 | */ | ||
| 79 | ✗ | double squared_lfs(const double* p) const { | |
| 80 | ✗ | index_t v = spatial_search_->nearest_vertex(p); | |
| 81 | ✗ | const double* q = spatial_search_->vertex_ptr(v); | |
| 82 | return | ||
| 83 | ✗ | geo_sqr(p[0] - q[0]) + | |
| 84 | ✗ | geo_sqr(p[1] - q[1]) + | |
| 85 | ✗ | geo_sqr(p[2] - q[2]); | |
| 86 | } | ||
| 87 | |||
| 88 | /** | ||
| 89 | * \brief Gets the number of poles. | ||
| 90 | * \return the number of poles. | ||
| 91 | */ | ||
| 92 | index_t nb_poles() const { | ||
| 93 | return poles_.size()/3; | ||
| 94 | } | ||
| 95 | |||
| 96 | /** | ||
| 97 | * \brief Gets a reference to a pole. | ||
| 98 | * \param[in] i the index of the pole | ||
| 99 | * \return a const pointer to the three coordinates of the | ||
| 100 | * \p i th pole | ||
| 101 | * \pre i < nb_poles() | ||
| 102 | */ | ||
| 103 | const double* pole(index_t i) const { | ||
| 104 | geo_debug_assert(i < nb_poles()); | ||
| 105 | return &poles_[3*i]; | ||
| 106 | } | ||
| 107 | |||
| 108 | protected: | ||
| 109 | /** | ||
| 110 | * \brief Constructs the internal representation used to compute | ||
| 111 | * the local feature size. | ||
| 112 | * \param[in] nb_pts number of points | ||
| 113 | * \param[in] pts pointer to the points coordinates, as a contiguous | ||
| 114 | * array of doubles. | ||
| 115 | */ | ||
| 116 | void init(index_t nb_pts, const double* pts); | ||
| 117 | |||
| 118 | private: | ||
| 119 | double sliver_angle_threshold_; | ||
| 120 | vector<double> poles_; | ||
| 121 | Delaunay_var spatial_search_; | ||
| 122 | }; | ||
| 123 | } | ||
| 124 | |||
| 125 | #endif | ||
| 126 |