Single dimension search

[Paul Harris]

Thanks Andrew,

I'll take a look at it sometime hopefully soon when I get a chance to
do some kdchart work...

if you make any more changes, send 'em through too :)

cheers
Paul

On 30/01/2008, Andrew Leung <anwleung at gmail.com> wrote:
> Hi All,
>
> I've attached some code which modifies the kdtree++ libraries to
> implement serialization functions and queries over any dimension
> combination. The goal of the serialization is speed and preserving
> order, so the tree doesn't need to be re-balanced after its read from disk.
>
> The code not really documented but there are not too many changes to the
> existing kdtree++ library files. A simple 'make' should build
> everything. Any comments, questions, or ways to improve/speed up the
> code would be welcome. Thanks for all of your help.
>
> Andrew
>
> Paul Harris wrote:
> > On 23/01/2008, Andrew Leung <anwleung at gmail.com> wrote:
> >
> >> Hi,
> >>
> >> I was wondering if any serialization libraries have been written for
> >> libkdtree. I am looking to serialize an entire tree to disk and will
> >> likely use the boost::serialization libraries. I'm just curious if
> >> anything similar has already been done.
> >>
> >>
> >
> > Not that I'm aware of.
> >
> >
> >> Also, has the library ever been run through valgrind? I ran it through
> >> with test_kdtree.cpp and found 40ish errors, but no memory leaks. Thanks.
> >>
> >
> > I think I did a while ago, might be time to double check things.
> >
> > Let me know what you come up with!
> >
> > cheers!
> > Paul
> >
> >
>
>
>