Re: Special query type for Spatial DB
From: Paul <paul_at_not.a.chance.ie>
Date: Fri, 16 Jan 2004 16:27:58 -0000
Message-ID: <MPG.1a72216b23a01fd99898a2_at_news1.eircom.net>
Date: Fri, 16 Jan 2004 16:27:58 -0000
Message-ID: <MPG.1a72216b23a01fd99898a2_at_news1.eircom.net>
pkl_at_mailme.dk says...
> I can not see how this problem is related to the travelling salesman
From the OP
I assumed in this case that the OP was asking for clusters of pulsars
and/or firestations that were nearer relative to each other than to all
other clusters of 50/10 pulsars/firestations.
> problem. Would you care to elaborate?
a)Given a bounded region in space, find me a cluster of 50 pulsars that
are closest to each other.
b)Given the state of California, find me a group of 10 fire-stations
that are closest to each other.
It seems to me that this is just a reformulation of the travelling salesman problem, but would be prepared to listen to someone who disagreed.
Paul...
> /Peter
-- plinehan y_a_h_o_o and d_o_t com C++ Builder 5 SP1, Interbase 6.0.1.6 IBX 5.04 W2K Pro Please do not top-post. "XML avoids the fundamental question of what we should do, by focusing entirely on how we should do it." quote from http://www.metatorial.comReceived on Fri Jan 16 2004 - 17:27:58 CET
