论文信息 - About Local Re nement of Tetrahedral Grids based on Bisection

About Local Re nement of Tetrahedral Grids based on Bisection

We present a novel approach to the development of a three-dimensional simplicial reenement strategies based on ideas that have been shown to be eeective for two-dimensional reenement. This procedure can be applied with other reenement algorithms with minimal adjustments and can be extended recursively to even higher-dimensional spaces.

Angel Plaza | Graham F. Careyy

[1] M. Rivara. A grid generator based on 4‐triangles conforming mesh‐refinement algorithms , 1987 .

[2] Ángel Plaza,et al. Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems , 1994 .

[3] R. Bank,et al. An algorithm for coarsening unstructured meshes , 1996 .

[4] J. Whitehead. On C 1 -Complexes , 1940 .

[5] Manolis Papadrakakis,et al. Advances in post and preprocessing for finite element technology , 1994 .

[6] William F. Mitchell,et al. Optimal Multilevel Iterative Methods for Adaptive Grids , 1992, SIAM J. Sci. Comput..

[7] Patricio Inostroza,et al. A Discussion on Mixed (Longest-Side Midpoint Insertion) Delaunay Techniques for the Triangulation Re , 1995 .

[8] Christoph M. Hoffmann,et al. How to Construct the Skeleton of CSG Objects , 1990 .

[9] M. Rivara,et al. A 3-D refinement algorithm suitable for adaptive and multi-grid techniques , 1992 .

[10] Eberhard Bänsch,et al. Local mesh refinement in 2 and 3 dimensions , 1991, IMPACT Comput. Sci. Eng..

[11] Barry Joe,et al. Quality Local Refinement of Tetrahedral Meshes Based on Bisection , 1995, SIAM J. Sci. Comput..

[12] Mark Price,et al. A Medial Object Toolkit for Meshing and Other Applications , 1995 .

[13] A. Liu,et al. On the shape of tetrahedra from bisection , 1994 .

[14] Baker Kearfott. A proof of convergence and an error bound for the method of bisection in ⁿ , 1978 .