Hi. Referring to the newly created MATH-1235.
I was looking for a way to improve the performance of a code that also needs, for some point "p", to select the "n" closest neighbours (from a list of sample data points). Browsing through web pages, some refer to BSP as a generalization of kd-tree; hence the question whether the implementation in CM can be used to provide the functionality in a way that is independent of its projected use to resolve MATH-1235. What do you think? Gilles --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
