comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » nearest node of Delauny tesselation
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: nearest node of Delauny tesselation [message #84126 is a reply to message #84060] Fri, 26 April 2013 16:46 Go to previous messageGo to previous message
Jeremy Bailin is currently offline  Jeremy Bailin
Messages: 618
Registered: April 2008
Senior Member
On 4/26/13 3:37 PM, ben.bighair wrote:
> 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
>

Yes, that would probably work... although converting each one separately
to an ROI sounds like overkill to just figure out where one point lies.
:) But that's the best suggestion, so I suspect that's what's going to
happen.

-Jeremy.
[Message index]
 
Read Message
Read Message
Read Message
Read Message
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) ] [ RSS ] [ PDF ]

Current Time: Sat Oct 11 14:54:24 PDT 2025

Total time taken to generate the page: 2.08222 seconds