|
![](/i/fill.gif) |
In article <38AD84F1.CF309BF6@peak.edu.ee>, Margus Ramst
<mar### [at] peak edu ee> wrote:
> Yes, but construct such a tree I would still have to test all points
> against the current one, no? I can't construct the tree at generation
> time, because consequent points are not necessarily spatially close
> (I'm talking about an actual case here).
> Perhaps I could start recursively subdividing the points along a set
> of planes... But then I would not end up with a constant number of
> points in a subset. I would have constant-volume subsets. How could I
> achieve the former goal?
I am not sure what you mean here...could you clarify?
--
Chris Huff
e-mail: chr### [at] yahoo com
Web page: http://chrishuff.dhs.org/
Post a reply to this message
|
![](/i/fill.gif) |