Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive and quality 3D meshing from imaging data
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Quality meshing for polyhedra with small angles
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A time-optimal delaunay refinement algorithm in two dimensions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
The propagation problem in longest-edge refinement
Finite Elements in Analysis and Design
Sliver removal by lattice refinement
Proceedings of the twenty-second annual symposium on Computational geometry
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
Variational tetrahedral meshing
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Contour interpolation with bounded dihedral angles
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Size complexity of volume meshes vs. surface meshes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
Constrained Delaunay tetrahedral mesh generation and refinement
Finite Elements in Analysis and Design
The propagation problem in longest-edge refinement
Finite Elements in Analysis and Design
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
New Bounds on the Size of Optimal Meshes
Computer Graphics Forum
Quality isosurface mesh generation using an extended marching cubes lookup table
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
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.