 |
|
|
|
|
|
||
|
|
||
|
|
||
|
|
|
|
|
|
||
|
|
||
|
|
||
|
|
|
|
|
|||||||||||||||||
Add Forum to Favorites | Send Topic To a Friend | View Forum FAQ | Track this topic |
Last Thread Next Thread |
| decomposing a polyhedron into tetrahedra |
|
 |
_gl_coder_one_ Member since: 6/1/2005 From: Mumbai, India |
|||
 Posted - 10/12/2006 2:39:26 AM |
||||
| Hi all Is there any method to break up any given polyhedron into a set of tetrahedra ? I need this for writing visualization algorithms for unstructured datasets. I plan to break down non-tetras into tetras and run a common visualization function( isosurface extraction ) on the resulting tetras. I may be following a totally wrong approach. If this is the case please point it out and give me some direction :) |
||||
|
||||
|
FReY Member since: 5/5/2000 From: Sunnyvale, CA, United States |
|||
|
Posted - 10/12/2006 11:44:25 AM |
||||
| Do you want to break it up into regular tetrahedra or not? If you don't require reqular tetrahedrons, there is a simple algorithm: 1.) select a point p that has 3 neighbours n0,n1,n2 in your polyhedron 2.) remove point p from your polyhedron set. 3.) add tetrahedron {p,n0,n1,n2} to your tetrahedron set. |
||||
|
||||
|
Anonymous Poster |
|||
Posted - 10/12/2006 12:18:22 PM |
||||
| Do a Google search on "polyhedron decomposition". The idea of decomposing into tetrahedra is the extension to 3D of the concept of triangulation of a polygon in 2D. However, in 3D there are additional problems to deal with. When you do the search, read the CGA FAQ link item. |
||||
|
||||
| All times are ET (US) |
Last Thread Next Thread |
|
