| Re: nearest node of Delauny tesselation [message #84053] |
Fri, 26 April 2013 00:01  |
lecacheux.alain
Messages: 325
Registered: January 2008
|
Senior Member |
|
|
Le jeudi 25 avril 2013 23:35:40 UTC+2, Jeremy Bailin a écrit :
> Under the category of "this must be easy, but I can't seem to figure out
>
> the right function":
>
>
>
> If I have created a Delauny tesselation using TRIANGULATE, how can I
>
> easily find which nodes form the triangle that contains an arbitrary
>
> point in the space?
>
>
>
> (more specifically, I am using /NATURAL_NEIGHB interpolation in GRIDDATA
>
> and it's going horribly wrong for one point, so I'm trying to figure out
>
> what nodes it's actually using in the interpolation for that point)
>
>
>
> Thanks,
>
> -Jeremy.
VORONOI procedure might be your friend.
alain.
|
|
|
|
| Re: nearest node of Delauny tesselation [message #84144 is a reply to message #84053] |
Fri, 26 April 2013 06:26  |
Jeremy Bailin
Messages: 618
Registered: April 2008
|
Senior Member |
|
|
On 4/26/13 2:01 AM, alx wrote:
> Le jeudi 25 avril 2013 23:35:40 UTC+2, Jeremy Bailin a �crit :
>> Under the category of "this must be easy, but I can't seem to figure out
>>
>> the right function":
>>
>>
>>
>> If I have created a Delauny tesselation using TRIANGULATE, how can I
>>
>> easily find which nodes form the triangle that contains an arbitrary
>>
>> point in the space?
>>
>>
>>
>> (more specifically, I am using /NATURAL_NEIGHB interpolation in GRIDDATA
>>
>> and it's going horribly wrong for one point, so I'm trying to figure out
>>
>> what nodes it's actually using in the interpolation for that point)
>>
>>
>>
>> Thanks,
>>
>> -Jeremy.
>
>
> VORONOI procedure might be your friend.
> alain.
>
But I thought that Voronoi polygons can be made up of multiple
triangles? Whereas GRIDDATA's documentation says that it's just using
the Delauny triangle.
-Jeremy.
|
|
|
|
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
