Huang Qiang

Hi, thank you for your interest! For your issue, MAX_BLOCK_NUM is used to control the maximum number of data points in a block. Please refer to lines 44-47 of h2_alsh.cc....

Thanks for your interest! nns() only returns the number of candidates for the query, which is not the list of the NNS index. The NN index is stored in the...

First of all, the nns() of the ball tree returns the approximate results, not the exact ones. The input parameter (i.e., int) of ith_id() starts from 0, which means that...

Before answering your questions, I suppose I should let you know that this repo targets at the problem of Point-to-Hyperplane Nearest Neighbor Search (P2HNNS). For the problem of P2HNNS, the...

Thank you for your assessments and your appreciation. For the point-to-point problem you aim to deal with, you might also need to carefully set up the new lower bound (or...

> Hello, I have a new problem in nns. p2h::Ball_Tree* tree = new p2h::Ball_Tree(N, D, leaf, XX); //p2h::BC_Tree_tree = new p2h::BC_Tree(N, D, leaf, XX); tree->display(); p2h::MinK_List_ list = new p2h::MinK_List(1)...

I suppose it is not the problem of the `cand` setting. Basically, the sweet range of the `leaf` size is in between 20 to 500. In most cases, we do...