Notes and Comments -- Tetrahedralization

    image from Peter Fleischman

• 3D equivalent of triangulation
• decompose a given polytope into non-overlapping tetrahedra, where the vertices of the tetrahedra must be vertices of the original polytope
• not always possible to do tetrahedralization without introducing additional vertices

                                                                            image from Matthew Kitching
• runs in Q(n+r²), where r is the number of reflex edges

back    next