From 9bc0408ca9d678c905640a567b8cf6c5765d3685 Mon Sep 17 00:00:00 2001 From: Jan Luca van den Busch Date: Fri, 2 Feb 2024 15:56:12 +0100 Subject: [PATCH] removed nearest neighbour missing implementation note --- README.rst | 9 +++------ 1 file changed, 3 insertions(+), 6 deletions(-) diff --git a/README.rst b/README.rst index b1acdc6..138b1a6 100644 --- a/README.rst +++ b/README.rst @@ -15,12 +15,9 @@ A fast ball tree implementation for three dimensional (weighted) data with an Euclidean distance norm. The base implementation is in `C` and there is a -wrapper for `Python`. - -The tree is optimised towards spatial correlation function calculations since -the query routines are geared towards range queries, i.e. counting pairs with a -given (range of) separations. Fixed number nearest neighbour search is currently -not implemented. +wrapper for `Python`. The tree is optimised towards spatial correlation function +calculations since it provides fast counting routinge, e.g. by implementing a +dualtree query algorithm. - Code: https://github.com/jlvdb/balltree.git - Docs: https://balltree.readthedocs.io/