On the adjacencies of triangular meshes based on skeleton-regular partitions
From MaRDI portal
Publication:1602807
DOI10.1016/S0377-0427(01)00484-8zbMath0998.51010MaRDI QIDQ1602807
Ángel Plaza, Maria-Cecilia Rivara
Publication date: 24 June 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
52B10: Three-dimensional polytopes
51M20: Polyhedra and polytopes; regular figures, division of spaces
Related Items
Non-equivalent partitions of \(d\)-triangles with Steiner points, Block-balanced meshes in iterative uniform refinement, Average adjacencies for tetrahedral skeleton-regular partitions, Non-degeneracy study of the 8-tetrahedra longest-edge partition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New trends in discrete and computational geometry
- Planar mesh refinement cannot be both local and regular
- A recursive approach to local mesh refinement in two and three dimensions
- Local refinement of simplicial grids based on the skeleton
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- A 3D refinement/derefinement algorithm for solving evolution problems
- Selective refinement/derefinement algorithms for sequences of nested triangulations
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- Local mesh refinement in 2 and 3 dimensions
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- Mesh relaxation: A new technique for improving triangulations
- On the Shape of Tetrahedra from Bisection
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
- Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
