Structured Tedrahedral Mesh Generation

August 20, 2009 by Luigi Giaccari · 2 Comments
Filed under: Algorithms, Computational Geometry, FEM 
VN:F [1.8.1_1037]
Rating: +1 (from 1 vote)
VN:F [1.8.1_1037]
Rating: 10.0/10 (2 votes cast)
MexImage

STRUCTTETRAMESH:
StructTetraMesh is a tool to build structured tetreaedral mesh on cuboid dataset. This is usefull in avoiding delaunay 3D triangulation that for  this kind of dataset are particularly slow and numerically unstable.
This tool allows a huge speed improvement against delaunayn for 3D points, the output triangulation will also be “slivers-less”, this is  particularly important for programs that need a conform triangulation like
fem analysis and search structure algorithms.

INPUT:
x,y,z must be vectors, they represent the axis of the cuboid. It is
also very important they need to be sorted. To improve performances there
is no check for sorted vectors so you have to check yourself.

OUTPUT:
The Cuboid points are stored in the p: N x 3 array, the tetraedral mesh
with points index is stored in tetr: Ntetr x 4 array. First point is
flagged with index one.

EXAMPLE

x=1:4;
y=1:6;
z=1:7;

[p,tetr]=StructTetraMesh(x,y,z);
figure(1)
axis equal
tetramesh(tetr,p);

Author: Giaccari Luigi
Created: 18/04/2009

For infos/questions/suggestions : giaccariluigi@msn.com

Download Now

VN:F [1.8.1_1037]
Rating: 10.0/10 (2 votes cast)
VN:F [1.8.1_1037]
Rating: +1 (from 1 vote)

Popularity: 22% [?]

Share and Enjoy:
  • Print
  • Digg
  • Sphinn
  • del.icio.us
  • Facebook
  • Mixx
  • Google Bookmarks
  • Blogplay
  • Live
  • PDF
  • Technorati
  • Twitter
  • Yahoo! Bookmarks
  • Add to favorites
  • email
  • MySpace
  • RSS

2 Comments

Tags: , , , ,

Structured Triangular Mesh Generation

August 18, 2009 by Luigi Giaccari · Leave a Comment
Filed under: Computational Geometry 
VN:F [1.8.1_1037]
Rating: 0 (from 0 votes)
VN:F [1.8.1_1037]
Rating: 0.0/10 (0 votes cast)
Structured triangular mesh

STRUCTTRIMESH:
StructTriMesh is a tool to build structured triangular mesh on rectangle
shaped dataset. This is useful in avoiding delaunay 2D triangulation in
order to improve speed performances.
It can be used for graphical purposes, fem analysis, sedata structures…

INPUT:
x,y must be vectors, they represent the axis of the rectangle. It is
also very important they need to be sorted. To improve performances, there
is no check for sorted vectors so you have to check yourself.

OUTPUT:
The mesh described as:

  • p: N x 2 array, points of the triangular mesh
  • t: Ntri x 3 array.  Triangles indexes referring to p array. First point is flagged with index one.

EXAMPLE:

x=1:4;
y=1:6;

[p,t]=StructTriMesh(x,y);
figure(1)
axis equal
hold on
title('Triangular Mesh','fontsize',14);
trimesh(t,p(:,1),p(:,2),'color','g');

Author: Giaccari Luigi
Created: 22/04/2009

For info/questions/suggestions : giaccariluigi@msn.com

Download Now

VN:F [1.8.1_1037]
Rating: 0.0/10 (0 votes cast)
VN:F [1.8.1_1037]
Rating: 0 (from 0 votes)

Popularity: 21% [?]

Share and Enjoy:
  • Print
  • Digg
  • Sphinn
  • del.icio.us
  • Facebook
  • Mixx
  • Google Bookmarks
  • Blogplay
  • Live
  • PDF
  • Technorati
  • Twitter
  • Yahoo! Bookmarks
  • Add to favorites
  • email
  • MySpace
  • RSS

Leave a Comment

Tags: , ,