Abstract
We give some special-case tetrahedralization algorithms. We first consider the problem of finding a tetrahedralization compatible with, a fixed triangulation of the boundary of a polyhedron. We then adapt our solution to the related problem of compatibly tetrahedralizing the interior and exterior of a polyhedron. We also show how to tetrahedralize the region between nested convex polyhedra with O(nlogn) tetrahedra and no Steiner points.
Get full access to this article
View all access options for this article.