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

Home » Public Forums » archive » Re: TRIANGULATE. Finding contiguous cells efficiently?
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: TRIANGULATE. Finding contiguous cells efficiently? [message #52720 is a reply to message #52718] Sun, 25 February 2007 19:37 Go to previous messageGo to previous message
Libertan is currently offline  Libertan
Messages: 8
Registered: February 2007
Junior Member
Wox, thanks for your time and effort. I wrote a lengthy reply which
either didn't get posted or was sent to your email address. In case
it has gone into the abyss, I did some timing experiments and your
loop routine was 10% faster than my routine (similarish but less
compactly written) for several thousand delaunay cells (run time ~170
seconds for 10^4 nodes). The ingenious vector routine you rote
obviously can't handle that many cells. I should've mentioned this
before.

thoughts:
1) The connectivity list might be fruitful after all.
2) Also I think that in these looped codes, the accumulated info in
the loop can be used to increasingly reduce the remaining workload.

I'd like to keep this topic alive, so I'll post any significant
progress. Anyone else feeling inspired?

Thanks again Wox
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Improving a piece of code with arrays and for-loops
Next Topic: oplot in 3d ??

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

Current Time: Fri Oct 10 19:25:38 PDT 2025

Total time taken to generate the page: 2.71601 seconds