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 #46399] Tue, 22 November 2005 11:16 Go to previous message
Xavier Llobet is currently offline  Xavier Llobet
Messages: 7
Registered: April 2005
Junior Member
In article <1132683502.085584.295570@g14g2000cwa.googlegroups.com>,
"Ed Hyer" <ejhyer@gmail.com> wrote:

> Those are some pretty big numbers for this problem. I'm not sure even
> HISTOGRAM can get around that.

HISTOGRAM should be able to handle 3E5 elements: called once per sphere
center.

> If this is homework, forget about it,
> but if it's your dissertation, I think you'll likely end up calling
> these C routines: http://www.cs.umd.edu/~mount/ANN/

If it's dissertation-grade work, a month of CPU is not much. The work
can be divided in as many pieces as desired (results for each center are
completely independent), and if you can use 6 PC's, from 17:00 to 09:00
plus week-end you are done in less than a week. And this is a
calculation that you need to do only once, as there are no parameters to
vary.

_x.

--
Only one "o" in my address.
[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 03:58:51 PDT 2025

Total time taken to generate the page: 1.68143 seconds