Re: kd trees in c#?
- From: "Bob" <bob@xxxxxxxxxxx>
- Date: Mon, 5 Mar 2007 16:27:44 +1300
Hi Stew,
Never heard of a kd tree until now,
but turned this up on Google.
Might help.
http://www.autonlab.org/autonweb/14665.html
regards
Bob
"stew dean" <stewdean@xxxxxxxxx> wrote in message
news:1173022806.705300.9970@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hi,
I'm new to C# but have done some perl and other bits of programming in
the past so have managed to put together some basic stuff after a few
days fumbling around.
I'm looking to do this as a web app.
I'm looking to set up a data base where things have a set of
dimensions, let's just say 4 dimesions but could be more. So an item
as an a, b, c and d coordinate in this space. Each dimension doesnt
have to be huge, 16 bit i fine, even 8 bit might work. Anyway what I
want to do is do a search the based upon a give value for a, b, d and
d will return the the items closest the point - so 1-10 first then
10-20.
I've read that a kd-tree is the way to go but not sure how to
implimetnt this, if there are library items for this etc. Also I'm not
sure a kd-tree will allow me to search, say, a 6d space but missing
out 2 dimensions in the search.
Can anyone give some points of where I can find some resources to get
me going on this?
Cheers
Stewart Dean
.
- References:
- kd trees in c#?
- From: stew dean
- kd trees in c#?
- Prev by Date: Re: Passing arrays to C# from VB6
- Next by Date: Re: CrystalReport ReportDocument.Load Exception
- Previous by thread: kd trees in c#?
- Next by thread: Re: Scan for new or modified files
- Index(es):
Relevant Pages
|
