File size: 5,378 Bytes
985c397 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 | // SPDX-License-Identifier: LGPL-2.1-or-later
/***************************************************************************
* Copyright (c) 2011 Werner Mayer <wmayer[at]users.sourceforge.net> *
* *
* This file is part of the FreeCAD CAx development system. *
* *
* This library is free software; you can redistribute it and/or *
* modify it under the terms of the GNU Library General Public *
* License as published by the Free Software Foundation; either *
* version 2 of the License, or (at your option) any later version. *
* *
* This library is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU Library General Public License for more details. *
* *
* You should have received a copy of the GNU Library General Public *
* License along with this library; see the file COPYING.LIB. If not, *
* write to the Free Software Foundation, Inc., 59 Temple Place, *
* Suite 330, Boston, MA 02111-1307, USA *
* *
***************************************************************************/
#ifdef _MSC_VER
# pragma warning(disable : 4396)
#endif
#include "KDTree.h"
#include <kdtree++/kdtree.hpp>
using namespace MeshCore;
struct Point3d
{
using value_type = float;
Point3d(const Base::Vector3f& f, PointIndex i)
: p(f)
, i(i)
{}
Point3d(const Point3d& pnt) = default;
Point3d(Point3d&& pnt)
: p(pnt.p)
, i(pnt.i)
{}
~Point3d() = default;
inline value_type operator[](const int N) const
{
return p[N];
}
inline bool operator==(const Point3d& other) const
{
return (this->p) == (other.p);
}
inline bool operator!=(const Point3d& other) const
{
return (this->p) != (other.p);
}
inline Point3d& operator=(const Point3d& other) = default;
inline Point3d& operator=(Point3d&& other)
{
this->p = other.p;
this->i = other.i;
return *this;
}
Base::Vector3f p;
PointIndex i;
};
using MyKDTree = KDTree::KDTree<3, Point3d>;
class MeshKDTree::Private
{
public:
MyKDTree kd_tree;
};
MeshKDTree::MeshKDTree()
: d(new Private)
{}
MeshKDTree::MeshKDTree(const std::vector<Base::Vector3f>& points)
: d(new Private)
{
PointIndex index = 0;
for (auto it : points) {
d->kd_tree.insert(Point3d(it, index++));
}
}
MeshKDTree::MeshKDTree(const MeshPointArray& points)
: d(new Private)
{
PointIndex index = 0;
for (const auto& it : points) {
d->kd_tree.insert(Point3d(it, index++));
}
}
MeshKDTree::~MeshKDTree()
{
delete d;
}
void MeshKDTree::AddPoint(const Base::Vector3f& point)
{
PointIndex index = d->kd_tree.size();
d->kd_tree.insert(Point3d(point, index));
}
void MeshKDTree::AddPoints(const std::vector<Base::Vector3f>& points)
{
PointIndex index = d->kd_tree.size();
for (auto it : points) {
d->kd_tree.insert(Point3d(it, index++));
}
}
void MeshKDTree::AddPoints(const MeshPointArray& points)
{
PointIndex index = d->kd_tree.size();
for (const auto& it : points) {
d->kd_tree.insert(Point3d(it, index++));
}
}
bool MeshKDTree::IsEmpty() const
{
return d->kd_tree.empty();
}
void MeshKDTree::Clear()
{
d->kd_tree.clear();
}
void MeshKDTree::Optimize()
{
d->kd_tree.optimize();
}
PointIndex MeshKDTree::FindNearest(const Base::Vector3f& p, Base::Vector3f& n, float& dist) const
{
std::pair<MyKDTree::const_iterator, MyKDTree::distance_type> it = d->kd_tree.find_nearest(
Point3d(p, 0)
);
if (it.first == d->kd_tree.end()) {
return POINT_INDEX_MAX;
}
PointIndex index = it.first->i;
n = it.first->p;
dist = it.second;
return index;
}
PointIndex MeshKDTree::FindNearest(
const Base::Vector3f& p,
float max_dist,
Base::Vector3f& n,
float& dist
) const
{
std::pair<MyKDTree::const_iterator, MyKDTree::distance_type> it
= d->kd_tree.find_nearest(Point3d(p, 0), max_dist);
if (it.first == d->kd_tree.end()) {
return POINT_INDEX_MAX;
}
PointIndex index = it.first->i;
n = it.first->p;
dist = it.second;
return index;
}
PointIndex MeshKDTree::FindExact(const Base::Vector3f& p) const
{
MyKDTree::const_iterator it = d->kd_tree.find_exact(Point3d(p, 0));
if (it == d->kd_tree.end()) {
return POINT_INDEX_MAX;
}
PointIndex index = it->i;
return index;
}
void MeshKDTree::FindInRange(const Base::Vector3f& p, float range, std::vector<PointIndex>& indices) const
{
std::vector<Point3d> v;
d->kd_tree.find_within_range(Point3d(p, 0), range, std::back_inserter(v));
indices.reserve(v.size());
for (const auto& it : v) {
indices.push_back(it.i);
}
}
|