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 #52693]

Tue, 27 February 2007 12:27

Libertan
Messages: 8
Registered: February 2007

Junior Member

In the above, when I said "Instead, would something like x+1./y
guarantee uniqueness?"
I meant A+1./B where A and B are vertex indices. The x,y coords of
the vertices don't play a role at all.

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: Wed Oct 08 18:52:16 PDT 2025

Total time taken to generate the page: 0.00444 seconds