Loading...
Please wait, while we are loading the content...
Similar Documents
Quality local refinement of tetrahedral meshes based on bisection (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Liu, Anwei Joe, Barry |
| Abstract | Abstract. Let T be a tetrahedral mesh. We present a 3-D local refinement algorithm for T which is mainly based on an 8-subtetrahedron subdivision procedure, and discuss the quality of refined meshes generated by the algorithm. It is proved that any tetrahedron T ∈T produces a finite number of classes of similar tetrahedra, independent of the number of refinement levels. Furthermore, η(Tn i) ≥ cη(T), where T ∈T,cis a positive constant independent of T and the number of refinement levels, Tn i is any refined tetrahedron of T, andηisa tetrahedron shape measure. It is also proved that local refinements on tetrahedra can be smoothly extended to their neighbors to maintain a conforming mesh. Experimental results show that the ratio of the number of tetrahedra actually refined to the number of tetrahedra chosen for refinement is bounded above by a small constant. 1. |
| File Format | |
| Journal | SIAM J. Sci. Comput |
| Language | English |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Tetrahedral Mesh Quality Local Refinement Refinement Level 3-d Local Refinement Algorithm Similar Tetrahedron Small Constant Local Refinement Conforming Mesh Refined Mesh 8-subtetrahedron Subdivision Procedure Experimental Result Isa Tetrahedron Shape Measure Tetrahedron Chosen Finite Number Refined Tetrahedron |
| Content Type | Text |
| Resource Type | Technical Report |
