Now showing items 2-5 of 5

    • Mesh Generation With Provable Quality Bounds 

      Mitchell, Scott A. (Cornell University, 1993-02)
      We consider the problem of generating a triangulation of provable quality for two and three dimensional polyhedral regions. That is, we seek a triangulation, allowing additional vertices called Steiner points, such that ...
    • Quality Mesh Generation in Higher Dimensions 

      Mitchell, Scott A.; Vavasis, Stephen A. (Cornell University, 1996-12)
      We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a qradtree-based algorithm that can triangulate any polyhedral region including nonconvexregions with holes. ...
    • Quality Mesh Generation in Three Dimensions 

      Mitchell, Scott A.; Vavasis, Stephen A. (Cornell University, 1992-02)
      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. ...
    • Quality Mesh Generation in Three Dimensions 

      Mitchell, Scott A.; Vavasis, Stephen A. (Cornell University, 1992-09)
      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. ...