KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod > Class Template Reference

Inheritance diagram for KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >:

Collaboration diagram for KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >:

Public Types
using	Traits
Public Types inherited from KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >
using	Traits

Public Member Functions
virtual	~Split ()=default
	Split (std::size_t dimensionality, std::size_t leaf_size, std::vector< T > data, size_t axis)
void	findPointsWithinRadius (const T &coord, double radius, std::vector< T > &selection) const override
std::size_t	countPointsWithinRadius (const T &coord, double radius) const override
	KdTree (const std::vector< T > &data, std::size_t leaf_size=100)
std::vector< T >	findPointsWithinRadius (const T &coord, double radius) const
std::size_t	countPointsWithinRadius (const T &coord, double radius) const
Public Member Functions inherited from KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >
virtual	~Node ()=default
	KdTree (const std::vector< T > &data, std::size_t leaf_size=100)
std::vector< T >	findPointsWithinRadius (const T &coord, double radius) const
std::size_t	countPointsWithinRadius (const T &coord, double radius) const

Private Attributes
size_t	m_axis
double	m_split_value
std::shared_ptr< Node >	m_left_child
std::shared_ptr< Node >	m_right_child
std::size_t	m_dimensionality
std::shared_ptr< Node >	m_root

Detailed Description

template<typename T, typename DistanceMethod = EuclideanDistance<T>>
template<typename T, typename DistanceMethod>
class KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >

Definition at line 60 of file KdTree.icpp.

Member Typedef Documentation

Traits

using KdTree::KdTree< T, DistanceMethod >::Traits

Definition at line 70 of file KdTree.h.

Constructor & Destructor Documentation

~Split()

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

virtual KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::~Split ( )

virtualdefault

Split()

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::Split ( std::size_t dimensionality, std::size_t leaf_size, std::vector< T > data, size_t axis )

inlineexplicit

Definition at line 63 of file KdTree.icpp.

References std::vector< T >::at(), std::vector< T >::begin(), std::vector< T >::end(), KdTree::KdTreeTraits< T >::getCoord(), m_axis, std::vector< T >::size(), and std::sort().

Here is the call graph for this function:

Member Function Documentation

countPointsWithinRadius() [1/2]

std::size_t KdTree::KdTree< T, DistanceMethod >::countPointsWithinRadius ( const T & coord, double radius ) const

virtual

Count how many points are within the given radius from the coordonate coord

Parameters

coord
radius

Returns

Implements KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >.

Definition at line 88 of file KdTree.icpp.

countPointsWithinRadius() [2/2]

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

std::size_t KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::countPointsWithinRadius ( const T & coord, double radius ) const

inlineoverridevirtual

Implements KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >.

Definition at line 103 of file KdTree.icpp.

References KdTree::KdTreeTraits< T >::getCoord(), m_axis, m_left_child, m_right_child, and m_split_value.

Here is the call graph for this function:

findPointsWithinRadius() [1/2]

std::vector< T > KdTree::KdTree< T, DistanceMethod >::findPointsWithinRadius	(	const T &	coord,
		double	radius ) const

Return the points that are within the given radius from the coordinate coord

Parameters

coord
radius

Returns

Definition at line 80 of file KdTree.icpp.

findPointsWithinRadius() [2/2]

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

void KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::findPointsWithinRadius ( const T & coord, double radius, std::vector< T > & selection ) const

inlineoverridevirtual

Implements KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >.

Definition at line 92 of file KdTree.icpp.

References KdTree::KdTreeTraits< T >::getCoord(), m_axis, m_left_child, m_right_child, and m_split_value.

Here is the call graph for this function:

KdTree()

KdTree::KdTree< T, DistanceMethod >::KdTree ( const std::vector< T > & data, std::size_t leaf_size = 100 )

explicit

Definition at line 72 of file KdTree.icpp.

Member Data Documentation

m_axis

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

size_t KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::m_axis

private

Definition at line 115 of file KdTree.icpp.

Referenced by countPointsWithinRadius(), findPointsWithinRadius(), and Split().

m_dimensionality

std::size_t KdTree::KdTree< T, DistanceMethod >::m_dimensionality

private

Definition at line 95 of file KdTree.h.

m_left_child

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

std::shared_ptr<Node> KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::m_left_child

private

Definition at line 118 of file KdTree.icpp.

Referenced by countPointsWithinRadius(), and findPointsWithinRadius().

m_right_child

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

std::shared_ptr<Node> KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::m_right_child

private

Definition at line 119 of file KdTree.icpp.

Referenced by countPointsWithinRadius(), and findPointsWithinRadius().

m_root

std::shared_ptr<Node> KdTree::KdTree< T, DistanceMethod >::m_root

private

Definition at line 96 of file KdTree.h.

m_split_value

template<typename T, typename DistanceMethod = EuclideanDistance<T>>

template<typename T, typename DistanceMethod>

double KdTree::KdTree< T, DistanceMethod >::Split< T, DistanceMethod >::m_split_value

private

Definition at line 116 of file KdTree.icpp.

Referenced by countPointsWithinRadius(), and findPointsWithinRadius().

---

The documentation for this class was generated from the following file:

• KdTree/KdTree/_impl/KdTree.icpp