Name
Abstract | ||
|---|---|---|
We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including nonconvex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to overrefine the domain, in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1137/S0097539796314124 | SIAM J. Comput. |
Keywords | Field | DocType |
mesh generator,d-dimensional region,mesh generation algorithm,bounded aspect ratio triangulation,quality mesh generation,higher dimensions,aspect ratio,qmg algorithm,input domain,factor time,quadtree-based algorithm,competing algorithm,qradtree-based algorithm,triangulation,finite element method,tetrahedra,polyhedron,mesh generation,technical report | Combinatorics,Polyhedron,Bounded set,Finite element method,Triangulation (social science),Tetrahedron,Mesh generation,Mathematics,Quadtree,Bounded function | Journal |
Volume | Issue | ISSN |
29 | 4 | 0097-5397 |
Citations | PageRank | References |
38 | 5.62 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Scott A. Mitchell | 1 | 461 | 77.77 |
| Stephen A. Vavasis | 2 | 607 | 135.74 |