comp.lang.idl-pvwave archive: archive » the fastest way to find number of points in sphere(radius r)

Home » Public Forums » archive » the fastest way to find number of points in sphere(radius r)

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

the fastest way to find number of points in sphere(radius r) [message #46422]

Tue, 22 November 2005 00:16

snfinder@naver.com
Messages: 35
Registered: August 2005

Member

Dear all,

First of all, my data is three-dimensional set.
I have to use a loop because I have a lot of positions of centers of
spheres that I should examine.
I want to find the # of points inside each sphere.
Now, I use a where function in order to find points inside the cube,
then I compute distances of all. Next, I use where function again to
examine # of distances less than radius of sphere.
I think it is fairly slow when large data is considered.

Is there any faster way?
The fastest way to find the number of points in sphere(radius r)

------------------------------------
data:
positions of points: X, Y, Z
centers of spheres: XC, YC, ZC
radius of spheres: r
------------------------------------

Help me~

Park

Report message to a moderator

[Message index]

		the fastest way to find number of points in sphere(radius r) By: snfinder@naver.com on Tue, 22 November 2005 00:16
		Re: the fastest way to find number of points in sphere(radius r) By: JD Smith on Mon, 28 November 2005 18:26

Previous Topic:	Re: Large array memory problem.
Next Topic:	gaussian air dispersion model

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sat Nov 29 05:31:21 PST 2025

Total time taken to generate the page: 1.99689 seconds