comp.lang.idl-pvwave archive: archive

Home » Public Forums » archive » fast search

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

Re: fast search [message #50887 is a reply to message #50819]

Thu, 19 October 2006 07:18

greg michael
Messages: 163
Registered: January 2006

Senior Member

Hi Marie,

Here's an annotated version.

I understand you're looking for the maximum z within the vicinity of
every point, with a gradually increasing radius of the vicinity. I
can't see what you're doing with this value, though - does it feed back
into the set of points somehow? What's the result you're trying to get?
Where do these points come from?

It would be simple to reduce my search code to 2-D - just remove the
z-lines, change the distance calculation, and the binning line to
b=bx+by*n_split. But I'm not sure if this is right way - it depends
what your z-values mean.

I've just realised that my later versions don't handle the case where
the pair lie across a subdivision boundary - only the slower first
version does that. Something to fix...

many greetings,
Greg

Report message to a moderator

[Message index]

		fast search By: m.goullant@gmail.com on Tue, 17 October 2006 05:09
		Re: fast search By: greg michael on Sat, 21 October 2006 14:42
		Re: fast search By: m.goullant@gmail.com on Fri, 20 October 2006 17:37
		Re: fast search By: greg michael on Thu, 19 October 2006 07:24
		Re: fast search By: greg michael on Thu, 19 October 2006 07:18
		Re: fast search By: m.goullant@gmail.com on Thu, 19 October 2006 03:51

Previous Topic:	Re: a slip of the fingers
Next Topic:	Re: resolving specific pro, functions inside of a file

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Thu Oct 09 21:54:53 PDT 2025

Total time taken to generate the page: 2.23952 seconds