range_search_recursive()

template<uint32_t K>

void scl::kd_tree< K >::range_search_recursive ( Node * node, const item & point, const item & condition, std::vector< item > & rangePoints, int depth ) const

inlineprivate

Recursive function to search for all nearest points in the kd_tree.

Parameters

[in]	node	recursive node.
[in]	point	Searched point in k d.
[in]	condition	nearest condition.
[in]	rangePoints	in range points.
[in]	depth	recursive depth.

Base case: If node is null, the point is not found.

If the current node within range, than sote it.

Calculate current dimension (cd).

Recursive both in left anf right.

Definition at line 463 of file KDTree.h.

    {
        if (node == nullptr) return;
 
        bool satisfied = true;
        for (int i = 0; i < K; i++)
        {
            if (std::abs(node->m_Point[i] - point[i]) > condition[i])
            {
                satisfied = false;
                break;
            }
        }
        if (satisfied)
        {
            rangePoints.push_back(node->m_Point);
        }
 
        int cd = depth % K;
 
        if (std::abs(node->m_Point[cd] - point[cd]) <= condition[cd])
        {
            if (node->m_Left)
            {
                range_search_recursive(node->m_Left, point, condition, rangePoints, depth + 1);
            }
            if (node->m_Right)
            {
                range_search_recursive(node->m_Right, point, condition, rangePoints, depth + 1);
            }
        }
        else if (node->m_Point[cd] - point[cd] > 0.0f)
        {
            if (node->m_Left)
            {
                range_search_recursive(node->m_Left, point, condition, rangePoints, depth + 1);
            }
        }
        else
        {
            if (node->m_Right)
            {
                range_search_recursive(node->m_Right, point, condition, rangePoints, depth + 1);
            }
        }
    }