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

Home » Public Forums » archive » CONTOUR problem
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: Contour Problem [message #39217 is a reply to message #39078] Mon, 26 April 2004 09:04 Go to previous messageGo to previous message
Jeff Patrick is currently offline  Jeff Patrick
Messages: 4
Registered: April 2004
Junior Member
I've checked the latitude and longitude and do not see any duplicate data,
so I guess my next question is what data type (int, single, double, etc.) is
Contour looking for? I could see that it may think there is duplicate data
if it is rounding the values I'm sending it. Also does Contour use the
value stored in the zero (0) index of the array (it seems that other IDL
function may not)?

Thanks for the help on this,

Jeff

"Christopher Lee" <lc@127.0.0.1> wrote in message
news:pan.2004.04.24.11.39.58.346601@127.0.0.1...
> On Fri, 23 Apr 2004 17:11:11 -0500, Jeff Patrick wrote:
>
>> I keep getting the following error in my code and I can't figure out
why.
>> Any help would be appreciated.
>>
>> % Internal error: Triangulation is invalid.
>>
>> CONTOUR, X, Y, Z, IRREGULAR=1, ISOTROPIC=1, /CLOSED, /CELL_FILL,
/OVERPLOT,
>> .....
>> each array is 32400 in size.
>>
>> Thank you,
>>
>> Jeff
>> jeff.patrick@computer.org
>
> Your getting the error because the contour function calls the triangulate
> function internally, which throws an error on your data. If you can
> separate the data from the Widget program, do it :) (save it to a file).
>
> Then run TRIANGULATE on the data, if that throws an error, it probably
> will, something is wrong with the data. e.g
>
> There are identical points in the data, triangulate works (in a fluffy,
> wordy kind of way) by drawing circles which have the points on the
> circumference. If the points are identical, it can't work. (This would be
> my guess).
>
> There are colinear points which otherwise satisfy the Delauney
> Triangulation algorithm, (good luck finding these). The triangle will be
> 'flat', i.e not a triangle. If this is going to happen, it would most
> likely happen on the first three points, which are needed to bootstrap the
> algorithm.
>
> Chris.
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Contour Problem
Next Topic: TIMEGEN bug (not the pre-6.4 bug that Fanning describes)

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Fri Oct 10 06:25:37 PDT 2025

Total time taken to generate the page: 0.00698 seconds