Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions

International Journal for Numerical Methods in Engineering

Volumn 37, Issue 4, 1994, Pages 693-713

  Joe, Barry ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FINITE ELEMENT METHOD; GEOMETRY; RECURSIVE FUNCTIONS; THREE DIMENSIONAL; TRIANGULATION;

CONVEX POLYHEDRON DECOMPOSITIONS; MESH DISTRIBUTION FUNCTION; POLYHEDRAL REGIONS; TETRAHEDRAL MESH GENERATION;

COMPUTATIONAL METHODS;

EID: 0028377627     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.1620370409     Document Type: Article

References (27)

1. Automatic three‐dimensional mesh generation by the modified‐octree technique
2. Automatic mesh generation from solid models based on recursive spatial decompositions
3. A combined octree/Delaunay method for fully automatic 3‐D mesh generation
4. A fully automatic three‐dimensional mesh generator for complex geometries
5. Raded tetrahedral finite element meshes
6. Automatic three‐dimensional mesh generation by the finite octree technique
7. Solid/solid classification operations for recursive spatial decomposition and domain triangulation of solid models
8. Finite element Euler computations in three dimensions
9. An approach to automatic three‐dimensional finite element mesh generation
10. Automatic mesh generation for complex three‐dimensional regions using a constrained Delaunay triangulation
11. A hierarchical approach to automatic finite element mesh generation
12. Triangular meshes for regions of complicated shape
13. Delaunay triangular meshes in convex polygons
14. Convex partitions of polyhedra: a lower bound and worst‐case optimal algorithm
15. Hree‐dimensional triangulations from local transformations
16. Convex decomposition of polyhedra and robustness
17. Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation
18. Three‐dimensional boundary‐constrained triangulations
19. Construction of three‐dimensional Delaunay triangulations using local transformations
20. Computing the n‐dimensional Delaunay tessellation with application to Voronoi polytopes
21. GEOMPACK — a software package for the generation of meshes using geometric algorithms
22. The origins of the teapot