Show simple item record

dc.contributor.authorMitchell, Scott A.en_US
dc.contributor.authorVavasis, Stephen A.en_US
dc.description.abstractWe show how to triangulate a three dimensional polyhedral region with holes. Our triangulation is optimal in the following two senses: First, our triangulation achieves the best possible aspect ratio up to a constant. Second, for any other triangulation of the same region into $m$ triangles with bounded aspect ratio, our triangulation has size $n$ = $O$($m$). Such a triangulation is desired as an initial mesh for a finite element mesh refinement algorithm. Previous three dimensional triangulation schemes either worked only on a restricted class of input, or did not guarantee well-shaped tetrahedra, or were not able to bound the output size. We build on some of the ideas presented in previous work by Bern, Eppstein and Gilbert, who have shown how to triangulate a two dimensional polyhedral region with holes, with similar quality and optimality bounds.en_US
dc.format.extent5901463 bytes
dc.format.extent1555481 bytes
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleQuality Mesh Generation in Three Dimensionsen_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record