dc.contributor.author Mitchell, Scott A. en_US dc.contributor.author Vavasis, Stephen A. en_US dc.date.accessioned 2007-04-23T17:57:43Z dc.date.available 2007-04-23T17:57:43Z dc.date.issued 1992-02 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR92-1267 en_US dc.identifier.uri https://hdl.handle.net/1813/7107 dc.description.abstract We 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.extent 5901463 bytes dc.format.extent 1555481 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title Quality Mesh Generation in Three Dimensions en_US dc.type technical report en_US
﻿