comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: the fastest way to find number of points in sphere(radius r)
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: the fastest way to find number of points in sphere(radius r) [message #46405 is a reply to message #46403] Tue, 22 November 2005 08:53 Go to previous messageGo to previous message
Haje Korth is currently offline  Haje Korth
Messages: 651
Registered: May 1997
Senior Member
Here the short answer: There is no way to avoid looping over your centers.
Xavier's method is the best you can do.

Haje

PS: To the experts: Please don't tell me that HISTOGRAM is the solution.
This functions usually does everything I cannot comprehend. :-)

"PYJ" <snfinder@naver.com> wrote in message
news:1132665267.676156.221240@g49g2000cwa.googlegroups.com.. .
> Thank you, Xavier Llobet~^^
>
> Actually, I expect a vectorizing method. (finding number of points
> about all centers at a time.)
>
> By the way,
> The points that I have are about 5*10^5.
> The number of centers is about 3*10^6.
> These are quite large.
>
> Anyway, I can't understand your way exactly.
> Can you explain it more ?
>
> So sph(2,*) is the array of distances.
> -> distances? Whose distances?
> ***I need a number of points. ***
> Do I use a where function about every centers again?
> I want to avoid loops if possible.
>
> Help, again. ^^
>
> ^_^
>
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: image display with different pixel size in x & y
Next Topic: Re: 3d space set up and plotting data on maps

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Sat Oct 11 21:12:46 PDT 2025

Total time taken to generate the page: 1.99925 seconds