Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: neighbor tetrahedrals
Replies: 2   Last Post: Sep 29, 2011 2:47 PM

 Messages: [ Previous | Next ]
 Marios Karaoulis Posts: 89 Registered: 5/10/10
neighbor tetrahedrals
Posted: Sep 29, 2011 1:36 PM

Hi,

Let's say we have a series of tetrahedral

d = [-100:1:100];
[x,y,z] = meshgrid(d,d,d); % A cube
x = [x(:);0];
y = [y(:);0];
z = [z(:);0];
% [x,y,z] are corners of a cube plus the center.
dt = DelaunayTri(x,y,z);

I need for each of the tetrahedral, which are the "neigtbors". And
since I have the nodes in dt, I would like to find for each
tetrahedral (described in dt) which are the other that share 3 nodes.

If any fast way to do that? I have 1e6 tetrahedral, and the for loops
joint with find and intersect commands is slow.

Thnaks

Date Subject Author
9/29/11 Marios Karaoulis
9/29/11 Steven Lord
9/29/11 Marios Karaoulis