A comparative study between some bisection based partitions in 3D
From MaRDI portal
Recommendations
Cites work
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- A comparison of adaptive refinement techniques for elliptic problems
- A grid generator based on 4-triangles conforming mesh-refinement algorithms
- A recursive approach to local mesh refinement in two and three dimensions
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Local mesh refinement in 2 and 3 dimensions
- Local refinement of simplicial grids based on the skeleton
- ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
- On the Shape of Tetrahedra from Bisection
- Optimal Multilevel Iterative Methods for Adaptive Grids
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
- Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
Cited in
(8)- Properties of triangulations obtained by the longest-edge bisection
- Partition of unity refinement for local approximation
- The 8T-LE partition applied to the obtuse triangulations of the 3D-cube
- The eight-tetrahedra longest-edge partition and Kuhn triangulations
- Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra
- On numerical regularity of trisection-based algorithms in 3D
- Non-equivalent partitions of \(d\)-triangles with Steiner points
- The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube
This page was built for publication: A comparative study between some bisection based partitions in 3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573278)