|
Viewing Issue Simple Details
[ Jump to Notes ]
|
[ View Advanced ]
[ Issue History ]
[ Print ]
|
|
ID |
Category |
Severity |
Reproducibility |
Date Submitted |
Last Update |
|
0000835 |
[ALGLIB] General |
feature |
have not tried |
2018-11-02 16:40 |
2018-11-02 16:40 |
|
|
Reporter |
SergeyB |
View Status |
public |
|
|
Assigned To |
SergeyB |
|
Priority |
normal |
Resolution |
implemented |
|
|
Status |
resolved |
|
Product Version |
|
|
|
Summary |
0000835: IMPLEMENTED: kd-trees now support unordered distance-based queries |
|
Description |
Unordered distance-based queries (all neighbors within user-specified distance) are faster than standard ones which sort points by their distance. Specific speed-up is about 10% for small queries (a few points are returned) but can be higher for larger queries. |
|
Additional Information |
|
|
|
Programming language |
Unspecified |
|
|
Attached Files |
|
|
|
Relationships 
