...
1st call with (radius_low_bound = 0.0, radius_high_bound = inf), get result distances like this:
| Code Block |
|---|
{d(0), d(1), d(2), ..., d(n-1)} |
{d(0), d(1), d(2), ..., d(n-1)}
2nd call with (radius_low_bound = d(n-1), radius_high_bound = inf), get result distances like this:
{d(n), d(n+1), d(n+2), ..., d(2n-1)}
3rd call with (radius_low_bound = d(2n-1), radius_high_bound = inf), get result distances like this:
{d(2n), d(2n+1), d(2n+2), ..., d(3n-1)}
...
- NQ > 1 (suppose NQ = 2)
...