On Numerical Regularity of Trisection-Based Algorithms in 3D
type: Item
instance of: scholarly article
title: On Numerical Regularity of Trisection-Based Algorithms in 3D
zbMATH Open document ID: 1355.65033
DOI: 10.1007/978-3-319-32857-7_35
author: Sergey Korotov
author: Ángel Plaza
author: José P. Suárez
author: Pilar Abad
published in: Springer Proceedings in Mathematics & Statistics
publication date: 2017-01-13T00:00:00Z
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 6674328
zbMATH Keywords: longest-edge trisection
zbMATH Keywords: tetrahedral mesh
zbMATH Keywords: mesh adaptivity
zbMATH Keywords: mesh regularity
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithm
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-32857-7 35
OpenAlex ID: W2508187310
cites work: Locally Adapted Tetrahedral Meshes Using Bisection
cites work: Local mesh refinement in 2 and 3 dimensions
cites work: On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
cites work: On the equivalence of ball conditions for simplicial finite elements in \(\mathbf R^d\)
cites work: Q4229816
cites work: An analysis of simplex shape measures for anisotropic meshes
cites work: Red refinements of simplices into congruent subsimplices
cites work: A recursive approach to local mesh refinement in two and three dimensions
cites work: Q3123991
cites work: Longest-edge \(n\)-section algorithms: properties and open problems
cites work: Verification of three-dimensional anisotropic adaptive processes
cites work: Relationship between tetrahedron shape measures
cites work: Quality Local Refinement of Tetrahedral Meshes Based on Bisection
cites work: Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
cites work: A comparative study between some bisection based partitions in 3D
cites work: Local refinement of simplicial grids based on the skeleton
cites work: A 3D refinement/derefinement algorithm for solving evolution problems
cites work: Non-degeneracy study of the 8-tetrahedra longest-edge partition
cites work: On the non-degeneracy property of the longest-edge trisection of triangles
cites work: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
cites work: Q3423085
cites work: On \(C^1\)-complexes
cites work: Q4867284
description: scientific article; zbMATH DE number 6674328