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

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

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

Re: nearest node of Delauny tesselation [message #84128 is a reply to message #84060]

Fri, 26 April 2013 13:37

ben.bighair
Messages: 221
Registered: April 2007

Senior Member

On Thursday, April 25, 2013 5:35:40 PM UTC-4, Jeremy Bailin wrote:
> 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)
>

Hi,

COuld you use IDLanROI::ContainsPoint()? You would have to convert the triangulations to ROIs first.

Cheers,
Ben

Report message to a moderator

[Message index]

		nearest node of Delauny tesselation By: Jeremy Bailin on Thu, 25 April 2013 14:35
		Re: nearest node of Delauny tesselation By: ben.bighair on Fri, 26 April 2013 19:32
		Re: nearest node of Delauny tesselation By: Jeremy Bailin on Fri, 26 April 2013 16:46
		Re: nearest node of Delauny tesselation By: ben.bighair on Fri, 26 April 2013 13:37

Previous Topic:	IDL 8.2.2 released
Next Topic:	my IDL7.0 always shut down when starting it, there is an free download site available ?

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 08:21:56 PDT 2025

Total time taken to generate the page: 0.64172 seconds