range_search()

template<uint32_t K>

auto scl::kd_tree< K >::range_search ( const item & point, const item & condition ) const -> std::vector<item>

inline

Search for all points within given range. Start at the root. If the current node is within the range, add it to the result. Recursively search the left and/or right subtrees if the range intersects their respective spaces. Prune the search if the current node’s space does not intersect the query range.

Parameters

[in]	point	Searched point in k d.
[in]	condition	allowed distance for neighbours.

Returns

Returns near points.

Definition at line 660 of file KDTree.h.

    {
        std::vector<kd_tree<K>::item> rangePoints;
        range_search_recursive(m_Root, point, condition, rangePoints, 0);
        return rangePoints;
    }