Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » Software » comp.soft-sys.matlab

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Marios Karaoulis

Posts: 88
Registered: 5/10/10
neighbor tetrahedrals
Posted: Sep 29, 2011 1:36 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.