Clear Filters
Clear Filters

How to assign a specific values to the nearest X,Y point

4 views (last 30 days)
Dear all,
I have two vectors X and Y which represents the vertices of a delauny triangulation.
Additionally I have two other vectors lat and lon which represents latitude and longitude respectively and are associated to a specific sound speed profile (SSP).
What I need is to obtain a matrix resulting from the assignment of SSP values to the all (X,Y) points taking into account the distances between (X,Y) points and SSP(Longitude,Latitude) .
In fact what I want is to according to the distance between (X,Y) and (Lon,Lat) points assign the SSP value.
Thanks in advance for your help.

Answers (1)

Matt J
Matt J on 24 Sep 2021
Edited: Matt J on 24 Sep 2021
See also griddedInterpolant.
Ricardo Duarte
Ricardo Duarte on 24 Sep 2021
Maybe I'm messing this up but I not sure that this solution gives me the result I want.
Consider the following figure:
I have my (X,Y) point and I have four other areas (A,B,C and D squares) here the ssp was calculated. What I want is to evaluate the distance between my (X,Y) point to the A,B,C and D squares and choose only the square that is closer to (X,Y) and then use the SSP of that square.
For example, in this case, I would choose the B square and discard the others. Then I would change the location of (X,Y) and to the same procedure.
Thank you.
Matt J
Matt J on 24 Sep 2021
Edited: Matt J on 24 Sep 2021
The A,B,C,D points as you have drawn them are scattered not gridded. However, your attached data appears to be the opposite. You have an SSP data point for every combination of 55 LON coordinates and 48 LAT coordinates. Therefore, your nearest neighbors will be latticed, like below, and your problem becomes equivalent to nearest-neighbor interpolation:
If you did truly have non-gridded SSP values, you could use griddata or scatterdInterpolant instead,
but that is much less efficient than interp2 when it is applicable.
@Catalytic The L1 and L2 nearest-neighbors are equivalent. Because the neighbors being searched on are vertices of a rectangle surrounding the query point (X,Y), the L1 and L2 distances (or any p-distance) is a separable function of the coordinates and will always yield the same minimum distance point no matter which distance metric is used.

Sign in to comment.


Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!