Re: questions about libkdtree++

[martin f k. <ma...@ma...>]

also sprach Matthew Papakipos <ma...@pa...> [2004.12.03.0154 +0100]:
> i'm looking at wrapping this so i can use it inside perl.  has anyone don=
e this
> already?

No, but I would suggest using swig (www.swig.org) to generate the
wrappers automatically. This should be rather trivial.

Anyway, I would be very happy to have some perl wrappers and could
give you access to the code repository to host them!

> in test_kdtree.cpp
> am i correct in assuming that find_within_range finds all points within 3
> distance-squared from s?

Well, actually it's all the points within the hypercube around s, so
not the hypersphere.

> when the iterator is subsequently used, does it get the points in
> order of increasing distance from s?

No.

> is there an efficient way to get an iterator that will iterate
> through all points in order of increasing distance from s?  (i'll
> cut off the search once i find what i'm looking for to be fast).

There is a new function in CVS to get the nearest point, written by
Paul Harris. I am sure this can be extended in the way you need it.

Please subscribe to libkdtree-devel and libkdtree-announce, and then
write any further questions to the the -devel list.

Thanks,

--=20
martin;              (greetings from the heart of the sun.)
  \____ echo mailto: !#^."<*>"|tr "<*> mailto:" net@madduck
=20
invalid/expired pgp subkeys? use subkeys.pgp.net as keyserver!
spamtraps: mad...@ma...
=20
"literature always anticipates life.
 it does not copy it, but moulds it to its purpose.
 the nineteenth century, as we know it,
 is largely an invention of balzac."
                                                        -- oscar wilde