Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra
DOI10.1016/j.cam.2022.114150zbMath1490.65301OpenAlexW4210935334MaRDI QIDQ2114421
Publication date: 15 March 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114150
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Polyhedra and polytopes; regular figures, division of spaces (51M20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Unnamed Item
- The optimal refinement strategy for 3-D simplicial meshes
- Triangulations. Structures for algorithms and applications
- Enumeration and investigation of acute \(0/1\)-simplices modulo the action of the hyperoctahedral group
- Average adjacencies for tetrahedral skeleton-regular partitions
- Local refinement of simplicial grids based on the skeleton
- The 8T-LE partition applied to the obtuse triangulations of the 3D-cube
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Local nonobtuse tetrahedral refinements around an edge
- The eight-tetrahedra longest-edge partition and Kuhn triangulations
- A comparative study between some bisection based partitions in 3D
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- On Nonobtuse Simplicial Partitions
- Which Tetrahedra Fill Space?
- OCTREE-BASED HEXAHEDRAL MESH GENERATION
This page was built for publication: Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra
