Class NeighborhoodSearch

include/CompactNSearch.h:19–147

* @class NeighborhoodSearch * Stores point data multiple set of points in which neighborhood information for a fixed * radius r should be generated. */

* radius r should be generated.
*/
class NeighborhoodSearch
{

public:

	/**
	* Constructor.
	* Creates a new instance of the neighborhood search class.
	* @param r Search radius. If two points are closer to each other than a distance r they are considered neighbors.
	* @param erase_empty_cells If true. Empty cells in spatial hashing grid are erased if the points move.
	*/
	NeighborhoodSearch(Real r, bool erase_empty_cells = false);

	/**
	* Destructor.
	*/
	virtual ~NeighborhoodSearch() = default;

	/**
	* Get method to access a point set.
	* @param i Index of the point set to retrieve.
	*/
	PointSet const& point_set(unsigned int i) const { return m_point_sets[i];     }

	/**
	* Get method to access a point set.
	* @param i Index of the point set to retrieve.
	*/
	PointSet      & point_set(unsigned int i)       { return m_point_sets[i];     }


	/**
	* Returns the number of point sets contained in the search.
	*/
	std::size_t  n_point_sets()               const { return m_point_sets.size(); }

	/**
	* Get method to access the list of point sets.
	*/
	std::vector<PointSet> const& point_sets() const { return m_point_sets;        }

	/**
	* Get method to access the list of point sets.
	*/
	std::vector<PointSet>      & point_sets()       { return m_point_sets;        }

	/**
	* Increases the size of a point set under the assumption that the existing points remain at
	* the same position.
	* @param i Index of point set that will be resized.
	* @param x Pointer to the point position data. Must point to continguous data of 3 * n
	* real values.
	* @param n Number of points.
	*/
	void increase_point_set_size(unsigned int i, Real const* x, std::size_t n);

	/**
	* Creates and adds a new set of points.