Don't know if that will speed things up, but you could try
buffering all points in B by a given distance, then use
this to count the points in A that are inside the buffer polygons:
http://grass.osgeo.org/wiki/GRASS_AddOns#v.count.points.sh
You could still do as Hamish suggested to reduce the se
Hamish wrote:
> Richard wrote:
I have two large points files (>20,000 sites), and I want to
find the number of points in A falling within a given distance
of the points in B.
>
I can use a buffer from Map A and run v.distance, but it takes an
extremely long time, so su
Richard wrote:
> >> I have two large points files (>20,000 sites), and I want to
> >> find the number of points in A falling within a given distance
> >> of the points in B.
> >> I can use a buffer from Map A and run v.distance, but it takes an
> >> extremely long time, so suggestions would b
Moritz Lennert wrote:
> On 09/05/09 00:51, Richard Chirgwin wrote:
>> Hi all,
>>
>> I'm not sure if this has been solved before.
>>
>> I have two large points files (>20,000 sites), and I want to find the
>> number of
>> points in A falling within a given distance of the points in B. So the
>> desi
On 09/05/09 00:51, Richard Chirgwin wrote:
Hi all,
I'm not sure if this has been solved before.
I have two large points files (>20,000 sites), and I want to find the number of
points in A falling within a given distance of the points in B. So the desired
output would be:
Cat Point count fr
Hi all,
I'm not sure if this has been solved before.
I have two large points files (>20,000 sites), and I want to find the number of
points in A falling within a given distance of the points in B. So the desired
output would be:
Cat Point count from B
1 10
2 3
3 12
...etc
