-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Norman Vine schrieb:
IIRC I have been mentioning http://www.sdss.jhu.edu/htm/index.html
every time these kind of questions arise for years now :-)
:)
I know. Perhaps it's time that we implement it this time :)
CU,
Christian
-BEGIN PGP
Thanks for all the suggestions guys. I'm ashamed to say that I'd never heard
of the kd tree or the quad-tree before. Yes, the current bucket approach
works, and yes I'll probably use it this time (Special User Airspace records
for display on the kln89 map page), but the possibility of a more
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
As my last post to this topic was probably a bit cryptic for some I've
looked in the net a bit and have found:
http://taltos.pha.jhu.edu/htm/
Probably we can use their software directly - or use their algorithm to
partition the earth in such a way
On Sunday 19 February 2006 19:44, Christian Mayer wrote:
As my last post to this topic was probably a bit cryptic for some I've
looked in the net a bit and have found:
Hehe, not really cryptic.
Rather interresting!
http://taltos.pha.jhu.edu/htm/
Probably we can use their software directly
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
David Luff schrieb:
I'm considering the problem of looking up global data at the moment (eg. how
many navaids are within x miles of point p). So far I've only implemented
this in a very crude manner, by indexing a map of navaid pointers using FG
Hi,
On Friday 17 February 2006 01:51, David Luff wrote:
I'm considering the problem of looking up global data at the moment (eg.
how many navaids are within x miles of point p). So far I've only
implemented this in a very crude manner, by indexing a map of navaid
pointers using FG bucket
Selon David Luff :
I'm considering the problem of looking up global data at the moment (eg. how
many navaids are within x miles of point p). So far I've only implemented
this in a very crude manner, by indexing a map of navaid pointers using FG
bucket number, and then traversing all the
7 matches
Mail list logo
