comp.lang.idl-pvwave archive: archive » Re: nearest node of Delauny tesselation

Home » Public Forums » archive » Re: nearest node of Delauny tesselation

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

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.

Report message to a moderator

[Message index]

		Re: nearest node of Delauny tesselation By: lecacheux.alain on Fri, 26 April 2013 00:01
		Re: nearest node of Delauny tesselation By: Jeremy Bailin on Fri, 26 April 2013 06:26

Previous Topic:	Must Be Summer!
Next Topic:	cubic root

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 16:16:58 PDT 2025

Total time taken to generate the page: 0.00418 seconds