moveit2
The MoveIt Motion Planning Framework for ROS 2.
Loading...
Searching...
No Matches
NearestNeighbors.h
Go to the documentation of this file.
1/*********************************************************************
2 * Software License Agreement (BSD License)
3 *
4 * Copyright (c) 2008, Willow Garage, Inc.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
17 * * Neither the name of the Willow Garage nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
29 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
31 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 * POSSIBILITY OF SUCH DAMAGE.
33 *********************************************************************/
34
35/* Author: Ioan Sucan */
36
37// This file is a slightly modified version of <ompl/datastructures/NearestNeighbors.h>
38
39#pragma once
40
41#include <functional>
42#include <vector>
43
45{
47template <typename _T>
49{
50public:
52 typedef std::function<double(const _T&, const _T&)> DistanceFunction;
53
54 NearestNeighbors() = default;
56 NearestNeighbors(NearestNeighbors&&) noexcept = default;
57 NearestNeighbors& operator=(const NearestNeighbors&) = default;
58 NearestNeighbors& operator=(NearestNeighbors&&) noexcept = default;
59 virtual ~NearestNeighbors() = default;
60
62 virtual void setDistanceFunction(const DistanceFunction& distFun)
63 {
64 distFun_ = distFun;
65 }
66
69 {
70 return distFun_;
71 }
72
75 virtual bool reportsSortedResults() const = 0;
76
78 virtual void clear() = 0;
79
81 virtual void add(const _T& data) = 0;
82
84 virtual void add(const std::vector<_T>& data)
85 {
86 for (auto elt = data.begin(); elt != data.end(); ++elt)
87 add(*elt);
88 }
89
91 virtual bool remove(const _T& data) = 0;
92
94 virtual _T nearest(const _T& data) const = 0;
95
101 virtual void nearestK(const _T& data, std::size_t k, std::vector<_T>& nbh) const = 0;
102
108 virtual void nearestR(const _T& data, double radius, std::vector<_T>& nbh) const = 0;
109
111 virtual std::size_t size() const = 0;
112
114 virtual void list(std::vector<_T>& data) const = 0;
115
116protected:
119};
120} // namespace cached_ik_kinematics_plugin
Abstract representation of a container that can perform nearest neighbors queries.
NearestNeighbors(NearestNeighbors &&) noexcept=default
virtual void nearestK(const _T &data, std::size_t k, std::vector< _T > &nbh) const =0
Get the k-nearest neighbors of a point.
virtual _T nearest(const _T &data) const =0
Get the nearest neighbor of a point.
virtual void add(const std::vector< _T > &data)
Add a vector of points.
virtual void add(const _T &data)=0
Add an element to the datastructure.
std::function< double(const _T &, const _T &)> DistanceFunction
The definition of a distance function.
virtual bool reportsSortedResults() const =0
Return true if the solutions reported by this data structure are sorted, when calling nearestK / near...
virtual void setDistanceFunction(const DistanceFunction &distFun)
Set the distance function to use.
virtual void list(std::vector< _T > &data) const =0
Get all the elements in the datastructure.
virtual void nearestR(const _T &data, double radius, std::vector< _T > &nbh) const =0
Get the nearest neighbors of a point, within a specified radius.
DistanceFunction distFun_
The used distance function.
virtual std::size_t size() const =0
Get the number of elements in the datastructure.
const DistanceFunction & getDistanceFunction() const
Get the distance function used.
NearestNeighbors(const NearestNeighbors &)=default
virtual bool remove(const _T &data)=0
Remove an element from the datastructure.
virtual void clear()=0
Clear the datastructure.