comp.lang.idl-pvwave archive: archive » k-d tree IDL implementation

Home » Public Forums » archive » k-d tree IDL implementation

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

k-d tree IDL implementation [message #85061]

Fri, 28 June 2013 03:06

iainsteers
Messages: 2
Registered: June 2013

Junior Member

Hi all,

I've got a scenario that I believe suits using a k-d tree to store the data in IDL. The current implementation is based on an array and is okay for small data sets(<3000) but slows down when working with larger ones (>20000)

I have thousands of structures, each structure hold a series of x-y points.

Unfortunately I've been unable to find an implementation of k-d tree in IDL.
I'm also hesitant to implement my own in case it doesn't affect the speed that much and ends up being a waste of time.

Has anyone come across one before?

Report message to a moderator

Previous Topic:	Widget Weirdness
Next Topic:	endi and endif

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 15:49:43 PDT 2025

Total time taken to generate the page: 0.00383 seconds