# Multidimensional simplex meshing

I'm trying to figure how to make a simplex mesh on orthogonal domain. Basically it comes to this:

• Make (2) triangles of a rectangle
• Make (5) tetrahedrons of orthogonal prism (cuboid)
• etc.

I don't need any refinement, smallest possible number of simplex-es will do...

Is there any existing algorithm(s) that can do that for n-dimensional domain? If not, any idea?

Thank you!

-
You can start by building (an $n-$dimensional analogue of) an octree, then turn into simplicial mesh by refinement. –  user2468 Dec 6 '11 at 23:06
By refining I wont get simplexes. If i divide original rectangle into 4 smaller - still have to get triangles for 4 new ones. –  sivic Dec 6 '11 at 23:10
I'm sorry. I meant by converting the octree into a triangular mesh, just like you described in your post (a hexaherdon become 5 tetrahedrons etc). –  user2468 Dec 6 '11 at 23:45