comp.lang.idl-pvwave archive: archive » Re: TRIANGULATE. Finding contiguous cells efficiently?

Home » Public Forums » archive » Re: TRIANGULATE. Finding contiguous cells efficiently?

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

Re: TRIANGULATE. Finding contiguous cells efficiently? [message #52766 is a reply to message #52720]

Thu, 01 March 2007 06:39

Wox
Messages: 184
Registered: August 2006

Senior Member

This just puts two 32bit numbers in one 64bit number. The lowest value
is stored in the lower-order dword and the highest in the HO DWORD.
Without the '<' and '>', edge [a,b] wouldn't be the same as edge
[b,a].

No I see there is a mistake :-). It must be
c=(a>b) or ishft(long64(a<b),32)

On 28 Feb 2007 17:11:39 -0800, "Libertan" <tbethell@umich.edu> wrote:

> I'll give c=(a>b)+ishft(long64(a<b),32) a try. Sounds like something
> worth understanding.

Report message to a moderator

[Message index]

		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Libertan on Tue, 27 February 2007 12:27
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Libertan on Tue, 27 February 2007 11:44
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Wox on Mon, 26 February 2007 04:27
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Libertan on Sun, 25 February 2007 19:37
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Wox on Thu, 01 March 2007 06:44
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Wox on Thu, 01 March 2007 06:39
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Libertan on Wed, 28 February 2007 17:11
		Re: TRIANGULATE. Finding contiguous cells efficiently? By: Wox on Wed, 28 February 2007 01:42

Previous Topic:	Improving a piece of code with arrays and for-loops
Next Topic:	oplot in 3d ??

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Thu Oct 09 22:28:33 PDT 2025

Total time taken to generate the page: 0.40283 seconds