Home »
Public Forums »
archive »
Re: NEAREST LOCATION _ ARRAY VALUE PROBLEM
| Re: NEAREST LOCATION _ ARRAY VALUE PROBLEM [message #44334] |
Mon, 06 June 2005 00:24 |
Chris Lee
Messages: 101
Registered: August 2003
|
Senior Member |
|
|
In article <1117998502.492305.91910@z14g2000cwz.googlegroups.com>,
"Giorgos" <G.Aloizos@gmail.com> wrote:
> Hi....I have the following problem
> I have 2 arrays of exactly same dimensions giving latitudes and
> longitudes
> On the other part I have 3 arrays 2 with latitudes and longitudes again
> and a 3rd giving me the size of a variable....it is actually like a
> satellite image with each pixel giving me the brightness. I want to
> locate in the "image" where is the nearest pixel-location to each of the
> elements of my first group arrays that I have? How can I do it? is there
> any routine in IDL?I need to obtain closest pixel in a sense
>
If you're trying to rebin irregularly grided data onto a regular grid,
then you want TRIANGULATE (and TRIGRID).
If you want to weight the output by the number of input points, you
might want HISTOGRAM (or HIST_ND) instead.
If you want to know which points of the source data fall into each
point of the destination grid, then you want HISTOGRAM.
Chris.
|
|
|
|
Current Time: Wed Oct 08 17:39:55 PDT 2025
Total time taken to generate the page: 0.00899 seconds
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
