[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Another vectorisation question
From: |
Jaroslav Hajek |
Subject: |
Re: Another vectorisation question |
Date: |
Fri, 16 Jul 2010 18:52:31 +0200 |
2010/7/16 Jordi Gutiérrez Hermoso <address@hidden>:
> On 16 July 2010 11:08, John Reed <address@hidden> wrote:
>> Thank you for the feedback Jordi, I want to look up a certain grid
>> point and quickly find the indices of all the random x,y coordinates
>> that fall closest to that grid point.
>
> That does sound like a problem for quadtrees. You should consider that
> approach as well.
>
If there's a regular grid, quadtrees really are an overkill. All that
is needed is a sorted list along all the coordinates to get
logarithmic time, and you won't beat that even with quadtrees.
--
RNDr. Jaroslav Hajek, PhD
computing expert & GNU Octave developer
Aeronautical Research and Test Institute (VZLU)
Prague, Czech Republic
url: www.highegg.matfyz.cz
Re: Another vectorisation question, Jaroslav Hajek, 2010/07/16