Re: implementation of kdb trees in C++ on linux
Date: 26 Feb 2002 13:14:36 -0800
Message-ID: <6be8ba0a.0202261314.d18afd0_at_posting.google.com>
I did look at SHORE but as you said it handles just two dimensions ,
so that is not sufficient for me. I have decided to go ahead with
"Gist" from Berkeley. (gist.cs.berkeley.edu) , its a bit more work
than what I want to do , but it will serve my purpose.
Thanks for your help
-Asvin
Clifford Heath <cjh_nospam_at_managesoft.com> wrote in message news:<3C798FDF.30BCAE5C_at_managesoft.com>...
> Asvin Ananthanarayan wrote:
> > I am basically trying to do range queries on multidimensional "point"
> > objects and not polygons or rectangles. So I dont think a R,R* or any
> > of its variants would help me.
>
> R* is stronger than you need, but will still handle points quite well.
> But SHORE only does two dimensions currently, and it sounds like that's
> not enough.
>
> Have you considered grid files?
Received on Tue Feb 26 2002 - 22:14:36 CET